Avoiding long Berge cycles

DOI10.1016/j.jctb.2018.12.001zbMath1416.05157arXiv1805.04195OpenAlexW2962695057WikidataQ128767556 ScholiaQ128767556MaRDI QIDQ2312601

Ruth Luo, Alexandr V. Kostochka, Zoltan Fueredi

Publication date: 17 July 2019

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

extremal hypergraph theoryBerge cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items

A note on the Tur\'an number of a Berge odd cycle ⋮ On Berge-Ramsey problems ⋮ On non-degenerate Berge-Turán problems ⋮ Stability of extremal connected hypergraphs avoiding Berge-paths ⋮ $t$-Wise Berge and $t$-Heavy Hypergraphs ⋮ The Turán Number of Berge K_4 in Triple Systems ⋮ On the cover Turán number of Berge hypergraphs ⋮ General lemmas for Berge-Turán hypergraph problems ⋮ The structure of hypergraphs without long Berge cycles ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Connected hypergraphs without long Berge-paths ⋮ On \(r\)-uniform hypergraphs with circumference less than \(r\) ⋮ Hypergraph based Berge hypergraphs ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2 ⋮ On the cover Ramsey number of Berge hypergraphs ⋮ Berge cycles in non-uniform hypergraphs ⋮ On 2-connected hypergraphs with no long cycles

Cites Work

• Unnamed Item
• Forbidden Berge hypergraphs
• Hypergraph extensions of the Erdős-Gallai theorem
• The maximum number of cliques in graphs without long cycles
• An Erdős-Gallai type theorem for uniform hypergraphs
• General lemmas for Berge-Turán hypergraph problems
• On \(r\)-uniform hypergraphs with circumference less than \(r\)
• On maximal paths and circuits of graphs
• Extremal Results for Berge Hypergraphs