Some Properties of Chromatic Coefficients of Linear Uniform Hypergraphs

In this paper a formula for the coefficient of λ ^n-gh+g-1 in the chromatic polynomial of a linear h-uniform hypergraph H of order n and girth g is proposed provided (g,  h) ≠ (3, 3). This formula involves 13 types of spanning subhypergraphs of H for 3 ≤ h ≤ 5.     

Decompositions of the 3-uniform hypergraphs <Emphasis Type="Italic">K</Emphasis><Stack><Subscript>v</Subscript><Superscript>(3)</Superscript></Stack> into hypergraphs of a certain type

In this paper, we investigate a generalization of graph decomposition, called hypergraph decomposition. We show that a decomposition of a 3-uniform hypergraph K(3)v into a special kind of hypergraph K(3)4 - e exists if and only if v ≡ 0, 1, 2 (mod 9) and v ≥ 9.     

Packing,covering and decomposing of a complete uniform hypergraph into delta-systems

Anh-uniform hypergraph generated by a set of edges {E ₁,...,E _c} is said to be a delta-system Δ(p,h,c) if there is ap-element setF such that ∇F|=p andE _i⌢E _j=F,∀i≠j. The main result of this paper says that givenp, h andc, there isn ₀ such that forn≥n ₀ the set of edges of a completeh-uniform hypergraphK _n ^h can be partitioned into subsets generating isomorphic delta-systems Δ(p, h, c) if and only if . This result is derived from a more general theorem in which the maximum number of delta-systems Δ(p, h, c) that can be packed intoK _n ^h and the minimum number of delta-systems Δ(p, h, c) that can cover the edges ofK _n ^h are determined for largen. Moreover, we prove a theorem on partitioning of the edge set ofK _n ^h into subsets generating small but not necessarily isomorphic delta-systems.     

Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs

A hamiltonian path (cycle) in an n-vertex 3-uniform hypergraph is a (cyclic) ordering of the vertices in which every three consecutive vertices form an edge. For large n, we prove an analog of the celebrated Dirac theorem for graphs: there exists n₀ such that every n-vertex 3-uniform hypergraph H, n?n₀, in which each pair of vertices belongs to at least n/2−1 (⌊n/2⌋) edges, contains a hamiltonian path (cycle, respectively). Both results are easily seen to be optimal.     

The Hardness of 3-Uniform Hypergraph Coloring

We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n^1/5) colors. Our result immediately implies that for any constants k ≥ 3 and c₂ > c₁ > 1, coloring a k-uniform c₁-colorable hypergraph with c₂ colors is NP-hard; the case k = 2, however, remains wide open. This is the first hardness result for approximately-coloring a 3-uniform hypergraph that is colorable with a constant number of colors. For k ≥ 4 such a result has been shown by [14], who also discussed the inherent difference between the k = 3 case and k ≥ 4. Our proof presents a new connection between the Long-Code and the Kneser graph, and relies on the high chromatic numbers of the Kneser graph [19,22] and the Schrijver graph [26]. We prove a certain maximization variant of the Kneser conjecture, namely that any coloring of the Kneser graph by fewer colors than its chromatic number, has ‘many’ non-monochromatic edges. * Research supported by NSF grant CCR-9987845. † Supported by an Alon Fellowship and by NSF grant CCR-9987845. ‡ Work supported in part by NSF grants CCF-9988526 and DMS 9729992, and the State of New Jersery.     

Monochromatic Matchings in the Shadow Graph of Almost Complete Hypergraphs

Edge colorings of r-uniform hypergraphs naturally define a multicoloring on the 2-shadow, i.e., on the pairs that are covered by hyperedges. We show that in any (r – 1)-coloring of the edges of an r-uniform hypergraph with n vertices and at least (1-e)( *20c nr)(1-\varepsilon)\left( {\begin{array}{*{20}c} n\\ r\\ \end{array}}\right) edges, the 2-shadow has a monochromatic matching covering all but at most o(n) vertices. This result confirms an earlier conjecture and implies that for any fixed r and sufficiently large n, there is a monochromatic Berge-cycle of length (1 – o(1))n in every (r – 1)-coloring of the edges of K^(r)_n{K^{(r)}_{n}}, the complete r-uniform hypergraph on n vertices.     

Modified Lagrange–Galerkin methods of first and second order in time for convection–diffusion problems

We introduce modified Lagrange–Galerkin (MLG) methods of order one and two with respect to time to integrate convection–diffusion equations. As numerical tests show, the new methods are more efficient, but maintaining the same order of convergence, than the conventional Lagrange–Galerkin (LG) methods when they are used with either P ₁ or P ₂ finite elements. The error analysis reveals that: (1) when the problem is diffusion dominated the convergence of the modified LG methods is of the form O(h ^m+1 + h ² + Δt ^q ), q = 1 or 2 and m being the degree of the polynomials of the finite elements; (2) when the problem is convection dominated and the time step Δt is large enough the convergence is of the form O(\frach^m+1Dt+h²+Dt^q){O(\frac{h^{m+1}}{\Delta t}+h^{2}+\Delta t^{q})} ; (3) as in case (2) but with Δt small, then the order of convergence is now O(h ^m  + h ² + Δt ^q ); (4) when the problem is convection dominated the convergence is uniform with respect to the diffusion parameter ν (x, t), so that when ν → 0 and the forcing term is also equal to zero the error tends to that of the pure convection problem. Our error analysis shows that the conventional LG methods exhibit the same error behavior as the MLG methods but without the term h ². Numerical experiments support these theoretical results.     

Total domination of graphs and small transversals of hypergraphs

The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m, the transversal has at most 3n/7 vertices, and this bound is sharp in the complement of the Fano plane. Chvátal and McDiarmid [5] proved that every 3-uniform hypergraph with n vertices and edges has a transversal of size n/2. Two direct corollaries of these results are that every graph with minimal degree at least 3 has total domination number at most n/2 and every graph with minimal degree at least 4 has total domination number at most 3n/7. These two bounds are sharp.     

Hypergraphs with large transversal number and with edge sizes at least four

Let H be a hypergraph on n vertices and m edges with all edges of size at least four. The transversal number τ(H) of H is the minimum number of vertices that intersect every edge. Lai and Chang [An upper bound for the transversal numbers of 4-uniform hypergraphs, J. Combin. Theory Ser. B, 1990, 50(1), 129–133] proved that τ(H) ≤ 2(n+m)/9, while Chvátal and McDiarmid [Small transversals in hypergraphs, Combinatorica, 1992, 12(1), 19–26] proved that τ(H) ≤ (n + 2m)/6. In this paper, we characterize the connected hypergraphs that achieve equality in the Lai-Chang bound and in the Chvátal-McDiarmid bound.     

Efficiently Recognizing the P 4-Structure of Trees and of Bipartite Graphs Without Short Cycles

A 4-uniform hypergraph represents the P ₄-structure of a graph G if its hyperedges are the vertex sets of the P ₄'s in G. By using the weighted 2-section graph of the hypergraph we propose a simple efficient algorithm to decide whether a given 4-uniform hypergraph represents the P ₄-structure of a bipartite graph without 4-cycle and 6-cycle. For trees, our algorithm is different from that given by G. Ding and has a better running time namely O(n ²) where n is the number of vertices. Revised: February 18, 1998     

Recognizing Intersection Graphs of Linear Uniform Hypergraphs

A hypergraph is linear if any two distinct hyperedges have at most one common vertex. The existence of a polynomial algorithm is shown for deciding whether a graph of minimum degree δ ≥ 19 is the intersection graph of a linear 3-uniform hypergraph. This result improves a corollary of the finite forbidden subgraph characterization proved for δ ≥ 69 by Naik et al. in [8]. Essentially the same methods yield a polynomial recognition algorithm for the intersection graph of a linear r-uniform hypergraph, r ≥ 3, provided the minimum edge-degree of the graphs is at least 2r ² ? 3r + 1. This improves on the cubic bound that follows from the corresponding finite characterization result in [8].     

A splitting theorem for the weighted measure

Let M be an n-dimensional complete noncompact Riemannian manifold, h be a smooth function on M and dμ = e ^h dV be the weighted measure. In this article, we prove that when the spectrum of the weighted Laplacian \triangle_m{\triangle_{\mu}} has a positive lower bound λ₁(M) > 0 and the m(m > n)-dimensional Bakry-émery curvature is bounded from below by -\fracm-1m-2l₁(M){-\frac{m-1}{m-2}\lambda_1(M)}, then M splits isometrically as R × N whenever it has two ends with infinite weighted volume, here N is an (n − 1)-dimensional compact manifold.     

On balanced colorings of hypergraphs

This paper deals with an extremal problem concerning hypergraph colorings. Let k be an integer. The problem is to find the value m _k (n) equal to the minimum number of edges in an n-uniform hypergraph not admitting two-colorings of the vertex set such that every edge of the hypergraph contains k vertices of each color. In this paper, we obtain the exact values of m ₂(5) and m ₂(4), and the upper bounds for m ₃(7) and m ₄(9).     

The edge-coloring of complete hypergraphs I

This paper contains and generalizes the solution of the following classical problem:If h | n then the h-element subsets of an n-element set can be partitioned into (_h?1^n?1) classes so that every class contains $\text{n}\text{h}$ disjoint h-element sets and every h-element set appears in exactly one class. A short formulation of this statement is: If h | n then the hypergraph $\text{K}{}_{\mathrm{n}}{}^{\mathrm{h}}$ is 1-factorizable. In this paper we study the factorization and edge-coloring problems of the hypergraph K_rxm^h (which is the complete, regular, h-uniform, r-partite hypergraph with m vertices in each of the r classes of vertices).     

Perfect matchings in random s-uniform hypergraphs

Let E = {X₁, X₂…, X_m} where the X_i ? V for 1 ≤ i ≤ m are distinct. The hypergraph G = (V, E) is said to be s-uniform if |X₁| = s for 1 ≤ i ≤ m. A set of edges M = {X_i : i ? I } is a perfect matching if (i) i ≠ j ? I implies X_i ∩ X_i = 0, and (ii) ∪_i?I X_i = V. In this article we consider the question of whether a random s-uniform hypergraph contains a perfect matching. Let s ≥ 3 be fixed and m/n^4/3 → ∞. We show that an s-uniform hypergraph with m edges chosen uniformly from [74] contains a perfect matching with high probability. This improves an earlier result of Schmidt and Shamir who showed that m/n^3/2 → ∞ suffices. © 1995 John Wiley & Sons, Inc.     

An approximate Dirac-type theorem for k-uniform hypergraphs

A k-uniform hypergraph is hamiltonian if for some cyclic ordering of its vertex set, every k consecutive vertices form an edge. In 1952 Dirac proved that if the minimum degree in an n-vertex graph is at least n/2 then the graph is hamiltonian. We prove an approximate version of an analogous result for uniform hypergraphs: For every K ≥ 3 and γ > 0, and for all n large enough, a sufficient condition for an n-vertex k-uniform hypergraph to be hamiltonian is that each (k − 1)-element set of vertices is contained in at least (1/2 + γ)n edges. Research supported by NSF grant DMS-0300529. Research supported by KBN grant 2P03A 015 23 and N201036 32/2546. Part of research performed at Emory University, Atlanta. Research supported by NSF grant DMS-0100784.     

A Solution to a Problem of Jacobson,Kézdy and Lehel

We solve a problem proposed by Jacobson, Kézdy, and Lehel [4] concerning the existence of forbidden induced subgraph characterizations of line graphs of linear k-uniform hypergraphs with sufficiently large minimal edge-degree. Actually, we prove that for each k3 there is a finite set Z(k) of graphs such that each graph G with minimum edge-degree at least 2k²–3k+1 is the line graph of a linear k-uniform hypergraph if and only if G is a Z(k)-free graph.Acknowledgments. We thank the anonymous referees, whose suggestions helped to improve the presentation of the paper.Winter 2002/2003 DIMACS Award is gratefully acknowledged2000 Mathematics Subject Classification: 05C65 (05C75, 05C85)     

An answer to a question by J. Milnor

We consider two commuting automorphismsT ₁,T ₂ of the Lebesque space (M, M, μ) such thath _m,n=h(T ₁ ^m T ₂ ⁿ )<∞ whereh is the measure-theoretic entropy. Under additional assumptions we show the existence of the limits lim (1/m)h _m,n wherem→∞,n→∞,m/n→ω and ω is an irrational number.     

Forbidding Complete Hypergraphs as Traces

Let 2 ≤q ≤min{p, t − 1} be fixed and n → ∞. Suppose that is a p-uniform hypergraph on n vertices that contains no complete q-uniform hypergraph on t vertices as a trace. We determine the asymptotic maximum size of in many cases. For example, when q = 2 and p∈{t, t + 1}, the maximum is , and when p = t = 3, it is for all n≥ 3. Our proofs use the Kruskal-Katona theorem, an extension of the sunflower lemma due to Füredi, and recent results on hypergraph Turán numbers. Research supported in part by NSF grants DMS-0400812 and an Alfred P. Sloan Research Fellowship. Research supported in part by NSA grant H98230-06-1-0140. Part of the research conducted while his working at University of Illinois at Chicago as a NSF VIGRE postdot.