The structure of hypergraphs without long Berge cycles

DOI10.1016/J.JCTB.2020.04.007MaRDI QIDQ1998768zbMATH OpenOpenAlexFDO

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

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, http://real.mtak.hu/108657/1/1812.10737v2

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)

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$.

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

Cites work

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

Cited in

(20)

• Hypergraphs with no tight cycles
• 3-uniform hypergraphs without a cycle of length five
• Avoiding long Berge cycles. II: Exact bounds for all \(n\)
• Berge cycles in non-uniform hypergraphs
• Connected hypergraphs without long Berge-paths
• Stability of extremal connected hypergraphs avoiding Berge-paths
• The structure of hypergraphs without long Berge cycles
• Pósa-type results for Berge hypergraphs
• Stability of extremal connected hypergraphs avoiding Berge-paths
• Linear three-uniform hypergraphs with no Berge path of given length
• Large hypergraphs without tight cycles
• On the cover Turán number of Berge hypergraphs
• Cycles of given lengths in hypergraphs
• Hypergraphs with Few Berge Paths of Fixed Length between Vertices
• Localized version of hypergraph Erdős-Gallai theorem
• On 2-connected hypergraphs with no long cycles
• Avoiding long Berge cycles: the missing cases \(k=r+1\) and \(k=r+2\)
• Avoiding long Berge cycles
• On \(r\)-uniform hypergraphs with circumference less than \(r\)
• 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)