Toughness and Vertex Degrees

We study theorems giving sufficient conditions on the vertex degrees of a graph G to guarantee G is t‐tough. We first give a best monotone theorem when , but then show that for any integer , a best monotone theorem for requires at least nonredundant conditions, where grows superpolynomially as . When , we give an additional, simple theorem for G to be t‐tough, in terms of its vertex degrees.     

Improper Coloring of Sparse Graphs with a Given Girth,II: Constructions

A graph G is ‐colorable if can be partitioned into two sets and so that the maximum degree of is at most j and of is at most k. While the problem of verifying whether a graph is (0, 0)‐colorable is easy, the similar problem with in place of (0, 0) is NP‐complete for all nonnegative j and k with . Let denote the supremum of all x such that for some constant every graph G with girth g and for every is ‐colorable. It was proved recently that . In a companion paper, we find the exact value . In this article, we show that increasing g from 5 further on does not increase much. Our constructions show that for every g, . We also find exact values of for all g and all .     

A Mehta–Ramanathan theorem for linear systems with basepoints

Let be a normal complex projective polarized variety and an H‐semistable sheaf on X. We prove that the restriction to a sufficiently positive general complete intersection curve passing through a prescribed finite set of points remains semistable, provided that at each , the variety X is smooth and the factors of a Jordan–Hölder filtration of are locally free. As an application, we obtain a generalization of Miyaoka's generic semipositivity theorem.     

Decomposition of Complete Graphs into Isomorphic Complete Bipartite Graphs

A decomposition of a complete graph into disjoint copies of a complete bipartite graph is called a ‐design of order n. The existence problem of ‐designs has been completely solved for the graphs for , for , K_{2, 3} and K_{3, 3}. In this paper, I prove that for all , if there exists a ‐design of order N, then there exists a ‐design of order n for all (mod ) and . Giving necessary direct constructions, I provide an almost complete solution for the existence problem for complete bipartite graphs with fewer than 18 edges, leaving five orders in total unsolved.     

On the influence of second order uniformly elliptic operators in nonlinear problems

The purpose of the present paper is to discuss the role of second order elliptic operators of the type on the existence of a positive solution for the problem involving critical exponent where Ω is a smooth bounded domain in , , and λ is a real parameter. In particular, we show that if the function has an interior global minimum point x₀ such that is comparable to , where and is the identity matrix of order n, then the range of values of λ for which the problem above has a positive solution can change drastically from to .     

Destroying Noncomplete Regular Components in Graph Partitions

We prove that if G is a graph and such that then can be partitioned into sets such that and contains no noncomplete ‐regular components for each . In particular, the vertex set of any graph G can be partitioned into sets, each of which induces a disjoint union of triangles and paths.     

Matrices of completely Ramsey sets with infinitely many rows

The main result of the present article is the following: Let N be an infinite subset of , , and let be a matrix with infinitely many rows of completely Ramsey subsets of such that for every n, . Then there exist , a sequence of nonempty finite subsets of N, and an infinite subset T of such that for every infinite subset I of . We also give an application of this result to partitions of an uncountable analytic subset of a Polish space X into sets belonging to the σ‐algebra generated by the analytic subsets of X.     

Determinants of classical SG‐pseudodifferential operators

We introduce a generalized trace functional TR in the spirit of Kontsevich and Vishik's canonical trace for classical SG‐pseudodifferential operators on and suitable manifolds, using a finite‐part integral regularization technique. This allows us to define a zeta‐regularized determinant for parameter‐elliptic operators , , . For , the asymptotics of as and of as are derived. For suitable pairs we show that coincides with the so‐called relative determinant .     

Partial Online List Coloring of Graphs

For a graph G, let be the maximum number of vertices of G that can be colored whenever each vertex of G is given t permissible colors. Albertson, Grossman, and Haas conjectured that if G is s‐choosable and , then . In this article, we consider the online version of this conjecture. Let be the maximum number of vertices of G that can be colored online whenever each vertex of G is given t permissible colors online. An analog of the above conjecture is the following: if G is online s‐choosable and then . This article generalizes some results concerning partial list coloring to online partial list coloring. We prove that for any positive integers , . As a consequence, if s is a multiple of t, then . We also prove that if G is online s‐choosable and , then and for any , .     

The Large‐Time Solution of Burgers' Equation with Time‐Dependent Coefficients. I. The Coefficients Are Exponential Functions

In this paper, we consider an initial‐value problem for Burgers' equation with variable coefficients where x and t represent dimensionless distance and time, respectively, and , are given functions of t. In particular, we consider the case when the initial data have algebraic decay as , with as and as . The constant states and are problem parameters. Two specific initial‐value problems are considered. In initial‐value problem 1 we consider the case when and , while in initial‐value problem 2 we consider the case when and . The method of matched asymptotic coordinate expansions is used to obtain the large‐t asymptotic structure of the solution to both initial‐value problems over all parameter values.     

The Mendelsohn Triple Systems of Order 13

A triple cyclically contains the ordered pairs , , , and no others. A Mendelsohn triple system of order v, or , is a set V together with a collection of ordered triples of distinct elements from V, such that and each ordered pair with is cyclically contained in exactly λ ordered triples. By means of a computer search, we classify all Mendelsohn triple systems of order 13 with ; there are 6 855 400 653 equivalence classes of such systems.     

Extremal Graphs With a Given Number of Perfect Matchings

Let denote the maximum number of edges in a graph having n vertices and exactly p perfect matchings. For fixed p, Dudek and Schmitt showed that for some constant when n is at least some constant . For , they also determined and . For fixed p, we show that the extremal graphs for all n are determined by those with vertices. As a corollary, a computer search determines and for . We also present lower bounds on proving that for (as conjectured by Dudek and Schmitt), and we conjecture an upper bound on . Our structural results are based on Lovász's Cathedral Theorem.     

Saturation numbers for families of graph subdivisions

For a family of graphs, a graph G is ‐saturated if G contains no member of as a subgraph, but for any edge in , contains some member of as a subgraph. The minimum number of edges in an ‐saturated graph of order n is denoted . A subdivision of a graph H, or an H‐subdivision, is a graph G obtained from H by replacing the edges of H with internally disjoint paths of arbitrary length. We let denote the family of H‐subdivisions, including H itself. In this paper, we study when H is one of or , obtaining several exact results and bounds. In particular, we determine exactly for and show for n sufficiently large that there exists a constant such that . For we show that will suffice, and that this can be improved slightly depending on the value of . We also give an upper bound on for all t and show that . This provides an interesting contrast to a 1937 result of Wagner (Math Ann, 114 (1937), 570–590), who showed that edge‐maximal graphs without a K₅‐minor have at least edges.     

Semi‐classical resolvent estimates and regions free of resonances

We prove resolvent estimates for self‐adjoint operators of the form on , , where is a semi‐classical parameter and , , is a real‐valued potential. The potential is supposed to have very little regularity with respect to the radial variable, only. As a consequence, we obtain a region free of resonances in the case when V is of compact support.     

Finiteness Results in Triangle‐Free Quasi‐Symmetric Designs

Triangle‐free quasi‐symmetric 2‐ designs with intersection numbers ; and are investigated. Possibility of triangle‐free quasi‐symmetric designs with or is ruled out. It is also shown that, for a fixed x and a fixed ratio , there are only finitely many triangle‐free quasi‐symmetric designs. © 2012 Wiley Periodicals, Inc. J Combin Designs 00: 1‐6, 2012     

Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences

A is a hypergraph obtained from by splitting some or all of its vertices into more than one vertex. Amalgamating a hypergraph can be thought of as taking , partitioning its vertices, then for each element of the partition squashing the vertices to form a single vertex in the amalgamated hypergraph . In this paper, we use Nash‐Williams lemma on laminar families to prove a detachment theorem for amalgamated 3‐uniform hypergraphs, which yields a substantial generalization of previous amalgamation theorems by Hilton, Rodger, and Nash‐Williams. To demonstrate the power of our detachment theorem, we show that the complete 3‐uniform n‐partite multihypergraph can be expressed as the union of k edge‐disjoint factors, where for , is ‐regular, if and only if:

1. for all ,
2. for each i, , and
3. .

     

Maximal regularity for non‐autonomous Robin boundary conditions

We consider a non‐autonomous Cauchy problem where is associated with the form , where V and H are Hilbert spaces such that V is continuously and densely embedded in H. We prove H‐maximal regularity, i.e., the weak solution u is actually in (if and ) under a new regularity condition on the form with respect to time; namely Hölder continuity with values in an interpolation space. This result is best suited to treat Robin boundary conditions. The maximal regularity allows one to use fixed point arguments to some non linear parabolic problems with Robin boundary conditions.     

On admissible topologies in JB*‐triples

Given a complex JB*‐triple X, we define and study admissible topologies on X, i.e., locally convex topologies τ on X coarser than the norm topology, invariant under the group of surjective linear isometries of X, and such that the triple product is jointly ‐continuous on bounded subsets of X. As a consequence of the joint ‐continuity of the triple product, all holomorphic automorphisms of the open unit ball are homeomorphisms of and the natural action is jointly ‐continuous on .