Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs

DOI10.1016/j.endm.2017.07.003zbMath1378.05145arXiv1803.01953OpenAlexW2962920298MaRDI QIDQ5915815

Casey Tompkins, Abhishek Methuku, Dániel Grósz

Publication date: 18 January 2018

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

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

zbMATH Keywords

uniform hypergraphsBerge subgraphsgraph removal lemma

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

Induced Turán problems and traces of hypergraphs, Some tight lower bounds for Turán problems via constructions of multi-hypergraphs, The Turán Number of Berge K_4 in Triple Systems, General lemmas for Berge-Turán hypergraph problems, A note on saturation for Berge-\(G\) hypergraphs, Ramsey numbers of Berge-hypergraphs and related structures, Hypergraphs with Few Berge Paths of Fixed Length between Vertices, Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2, On the cover Ramsey number of Berge hypergraphs

Cites Work

• 3-uniform hypergraphs avoiding a given odd cycle
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
• Hypergraph Extensions of the Erdős-Gallai Theorem
• Triangle-Free Hypergraphs
• Extremal Results for Berge Hypergraphs
• Many \(T\) copies in \(H\)-free graphs