Regular Partitions of Hypergraphs: Counting Lemmas

DOI10.1017/S0963548307008565zbMATH Open1206.05072OpenAlexW2170253147WikidataQ124805513 ScholiaQ124805513MaRDI QIDQ5428366FDOQ5428366

M. 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

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

Cited In (33)

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

   Recommendations

• Regular Partitions of Hypergraphs: Regularity Lemmas 👍 👎
• The counting lemma for regular k‐uniform hypergraphs 👍 👎
• Regularity lemmas for hypergraphs and quasi-randomness 👍 👎
• Counting in hypergraphs via regularity inheritance 👍 👎
• Regularity properties for triple systems 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428366)