Note on the 3-graph counting Lemma

DOI10.1016/J.DISC.2007.08.054MaRDI QIDQ941395zbMATH OpenOpenAlexWikidataFDO

Authors B. Nagle, Vojtěch Rödl, M. 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

counting lemmahypergraph regularity lemmaSzemerédi's regularity lemma

Mathematics Subject Classification ID

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

Recommendations

• The counting lemma for regular k‐uniform hypergraphs
• Regularity properties for triple systems
• scientific article; zbMATH DE number 2086426
• Counting Small Cliques in 3-uniform Hypergraphs
• Regularity Lemma for k-uniform hypergraphs

Cites work

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

Cited in

(7)

• Sum-avoiding sets in groups
• Regularity properties for triple systems
• 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
• Counting Small Cliques in 3-uniform Hypergraphs
• scientific article; zbMATH DE number 4185602 (Why is no real title available?)
• A probabilistic counting Lemma for complete graphs
• A counting lemma for binary matroids and applications to extremal problems

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

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