Berge cycles in non-uniform hypergraphs

DOI10.37236/9346MaRDI QIDQ783055zbMATH OpenOpenAlexFDO

Authors Ruth Luo, Zoltán Füredi, Alexandr Kostochka

Publication date 30 July 2020

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Dirac-type minimum degree conditionsset systems without long Berge cycles

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Hypergraphs (05C65)

Abstract: We consider two extremal problems for set systems without long Berge cycles. First we give Dirac-type minimum degree conditions that force long Berge cycles. Next we give an upper bound for the number of hyperedges in a hypergraph with bounded circumference. Both results are best possible in infinitely many cases.

Review text

Summary: We consider two extremal problems for set systems without long Berge cycles. First we give Dirac-type minimum degree conditions that force long Berge cycles. Next we give an upper bound for the number of hyperedges in a hypergraph with bounded circumference. Both results are best possible in infinitely many cases.

Recommendations

• The structure of hypergraphs without long Berge cycles
• Avoiding long Berge cycles
• On \(r\)-uniform hypergraphs with circumference less than \(r\)
• Avoiding long Berge cycles. II: Exact bounds for all \(n\)
• On 3-uniform hypergraphs without a cycle of a given length

Cites work

• A method in graph theory
• Avoiding long Berge cycles
• Avoiding long Berge cycles: the missing cases k=r+1 and k=r+2
• Cycles of given lengths in hypergraphs
• scientific article; zbMATH DE number 3641483 (Why is no real title available?)
• scientific article; zbMATH DE number 3186565 (Why is no real title available?)
• scientific article; zbMATH DE number 3186566 (Why is no real title available?)
• Minimum degree of 3-graphs without long linear paths
• Note on 2-connected graphs with \(d(u)+d(v)\geq n-4\)
• On Maximal Circuits in Finite Graphs
• On maximal paths and circuits of graphs
• Rainbow matchings in Dirac bipartite graphs
• Some Theorems on Abstract Graphs
• The maximum number of cliques in graphs without long cycles

Cited in

(9)

• The structure of hypergraphs without long Berge cycles
• A Dirac-type theorem for Berge cycles in random hypergraphs
• Decomposition of complete uniform multi‐hypergraphs into Berge paths and cycles
• Hypergraphs with Few Berge Paths of Fixed Length between Vertices
• Dirac-type theorems for long Berge cycles in hypergraphs
• Pósa-type results for Berge hypergraphs
• A Dirac-type theorem for uniform hypergraphs
• A hypergraph analog of Dirac's theorem for long cycles in 2-connected graphs. II: Large uniformities
• Berge pancyclic hypergraphs

This page was built for publication: Berge cycles in non-uniform hypergraphs

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