Note on the 3-graph counting Lemma

DOI10.1016/j.disc.2007.08.054zbMath1169.05028OpenAlexW2115913661WikidataQ124988433 ScholiaQ124988433MaRDI QIDQ941395

Vojtěch Rödl, Brendan Nagle, Mathias Schacht

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.054

zbMATH Keywords

Szemerédi's regularity lemmacounting lemmahypergraph regularity lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Extremal set theory (05D05)

Related Items (2)

3-uniform hypergraphs of bounded degree have linear Ramsey numbers ⋮ Sum-avoiding sets in groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Ramsey properties of random hypergraphs
• Hypergraphs, quasi-randomness, and conditions for regularity
• Hypergraph regularity and the multidimensional Szemerédi theorem
• On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Regularity properties for triple systems
• Extremal problems on set systems
• Counting Small Cliques in 3-uniform Hypergraphs
• Hereditary Properties of Triple Systems
• Integer and fractional packings in dense 3‐uniform hypergraphs
• Regularity Lemma for k-uniform hypergraphs
• A Note on a Question of Erdős and Graham
• The counting lemma for regular k‐uniform hypergraphs
• The asymptotic number of triple systems not containing a fixed one

This page was built for publication: Note on the 3-graph counting Lemma