Berge cycles in non-uniform hypergraphs

DOI10.37236/9346zbMath1444.05101arXiv2002.01597OpenAlexW3046186585MaRDI QIDQ783055

Ruth Luo, Alexandr V. Kostochka, Zoltan Fueredi

Publication date: 30 July 2020

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

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum degree of 3-graphs without long linear paths
• Note on 2-connected graphs with \(d(u)+d(v)\geq n-4\)
• A method in graph theory
• The maximum number of cliques in graphs without long cycles
• Cycles of given lengths in hypergraphs
• Avoiding long Berge cycles
• On maximal paths and circuits of graphs
• On Maximal Circuits in Finite Graphs
• Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2
• Rainbow matchings in Dirac bipartite graphs
• Some Theorems on Abstract Graphs

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