On 3‐graphs with no four vertices spanning exactly two edges

DOI10.1112/blms.12681zbMath1521.05130arXiv2109.04944OpenAlexW3200824446MaRDI QIDQ6051388

Lior Gishboliner, István Tomon

Publication date: 20 September 2023

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.04944

zbMATH Keywords

hypergraphsextremal problemslower boundslinear algebraadditive number theoryproperty testing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new proof of the graph removal lemma
• Erdős-Hajnal-type theorems in hypergraphs
• Ramsey-type theorems
• Generalizations of the removal lemma
• Two Erdős-Hajnal-type theorems in hypergraphs
• Efficient removal without efficient regularity
• Hypergraph regularity and the multidimensional Szemerédi theorem
• On a property of the class of n-colorable graphs
• The Erdös-Hajnal Conjecture-A Survey
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
• A note on the Erdős-Hajnal property for stable graphs
• Testing subgraphs in large graphs
• Regularity Lemma for k-uniform hypergraphs
• Removal lemmas with polynomial bounds
• Easily Testable Graph Properties
• Regularity lemmas for stable graphs
• Every Monotone 3‐Graph Property is Testable
• The counting lemma for regular k‐uniform hypergraphs
• Partition relations for cardinal numbers
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• Efficient testing of large graphs