The structure of hypergraphs without long Berge cycles

DOI10.1016/j.jctb.2020.04.007zbMath1459.05224arXiv1812.10737OpenAlexW2982075030MaRDI QIDQ1998768

Nathan Lemons, Oscar Zamora, Nika Salia, Ervin Gyoeri

Publication date: 8 March 2021

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

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

zbMATH Keywords

extremal hypergraphsBerge cyclesBerge paths

Mathematics Subject Classification ID

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

Related Items (7)

3-uniform hypergraphs without a cycle of length five ⋮ Stability of extremal connected hypergraphs avoiding Berge-paths ⋮ On the cover Turán number of Berge hypergraphs ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Connected hypergraphs without long Berge-paths ⋮ On \(r\)-uniform hypergraphs with circumference less than \(r\) ⋮ On 2-connected hypergraphs with no long cycles

Cites Work

• Hypergraph extensions of the Erdős-Gallai theorem
• Cycles in bipartite graphs
• An Erdős-Gallai type theorem for uniform hypergraphs
• On \(r\)-uniform hypergraphs with circumference less than \(r\)
• Avoiding long Berge cycles
• On maximal paths and circuits of graphs

This page was built for publication: The structure of hypergraphs without long Berge cycles