The structure of hypergraphs without long Berge cycles

DOI10.1016/J.JCTB.2020.04.007zbMATH Open1459.05224arXiv1812.10737OpenAlexW2982075030MaRDI QIDQ1998768FDOQ1998768

Nathan Lemons, Ervin Győri, Oscar Zamora, Nika Salia

Publication date: 8 March 2021

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

Abstract: We study the structure of $r$-uniform hypergraphs containing no Berge cycles of length at least $k$ for $kleqr$, and determine that such hypergraphs have some special substructure. In particular we determine the extremal number of such hypergraphs, giving an affirmative answer to the conjectured value when $k=r$ and giving a a simple solution to a recent result of Kostochka-Luo when $k<r$.

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

Recommendations

• Connected hypergraphs without long Berge-paths
• Berge cycles in non-uniform hypergraphs
• On hypergraphs without loose cycles
• Hypergraphs with no cycle of a given length
• Hypergraphs with no tight cycles
• On 2-connected hypergraphs with no long cycles
• The number of hypergraphs without linear cycles
• Large hypergraphs without tight cycles
• scientific article; zbMATH DE number 1339824
• Hypergraphs with no odd cycle of given length

zbMATH Keywords

extremal hypergraphsBerge cyclesBerge paths

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (14)

• On \(r\)-uniform hypergraphs with circumference less than \(r\)
• Connected hypergraphs without long Berge-paths
• Pósa-type results for Berge hypergraphs
• On 2-connected hypergraphs with no long cycles
• 3-uniform hypergraphs without a cycle of length five
• Stability of extremal connected hypergraphs avoiding Berge-paths
• Large hypergraphs without tight cycles
• Localized version of hypergraph Erdős-Gallai theorem
• Stability of extremal connected hypergraphs avoiding Berge-paths
• Hypergraphs with Few Berge Paths of Fixed Length between Vertices
• Hypergraphs with no tight cycles
• Linear three-uniform hypergraphs with no Berge path of given length
• On the cover Turán number of Berge hypergraphs
• On Hamiltonian Berge cycles in [3]-uniform hypergraphs

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

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