Regular Partitions of Hypergraphs: Counting Lemmas

DOI10.1017/S0963548307008565zbMath1206.05072OpenAlexW2170253147WikidataQ124805513 ScholiaQ124805513MaRDI QIDQ5428366

Mathias Schacht, Vojtěch Rödl

Publication date: 22 November 2007

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548307008565

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (30)

Additive approximation of generalized Turán questions ⋮ Regular slices for hypergraphs ⋮ Embedding tetrahedra into quasirandom hypergraphs ⋮ A variant of the hypergraph removal lemma ⋮ On induced Ramsey numbers fork-uniform hypergraphs ⋮ Integer and fractional packings of hypergraphs ⋮ The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph ⋮ SZEMERÉDI’S THEOREM: AN EXPLORATION OF IMPURITY, EXPLANATION, AND CONTENT ⋮ Packing \(k\)-partite \(k\)-uniform hypergraphs ⋮ Extremal problems in uniformly dense hypergraphs ⋮ Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs ⋮ Minimum degree conditions for tight Hamilton cycles ⋮ F$F$‐factors in Quasi‐random Hypergraphs ⋮ Loose Hamilton cycles in hypergraphs ⋮ Local-vs-global combinatorics ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ A new proof of the density Hales-Jewett theorem ⋮ Hypergraphs with vanishing Turán density in uniformly dense hypergraphs ⋮ A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma ⋮ Tight cycles and regular slices in dense hypergraphs ⋮ Weak hypergraph regularity and linear hypergraphs ⋮ 3-uniform hypergraphs of bounded degree have linear Ramsey numbers ⋮ Hamilton \(\ell \)-cycles in uniform hypergraphs ⋮ Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs ⋮ Generalizations of the removal lemma ⋮ Hereditary properties of hypergraphs ⋮ A hypergraph blow-up lemma ⋮ Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ A tight bound for hypergraph regularity

This page was built for publication: Regular Partitions of Hypergraphs: Counting Lemmas