Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2

DOI10.1017/S0963548319000415zbMath1466.05148arXiv1808.07687MaRDI QIDQ4993098

Abhishek Methuku, Casey Tompkins, Oscar Zamora, Nika Salia, Beka Ergemlidze, Ervin Gyoeri

Publication date: 15 June 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

\(r\)-uniform hypergraph

Mathematics Subject Classification ID

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

Related Items (2)

Berge cycles in non-uniform hypergraphs ⋮ Multicolor Ramsey numbers for Berge cycles

Cites Work

• On the maximum size of connected hypergraphs without a path of given length
• Hypergraph extensions of the Erdős-Gallai theorem
• An Erdős-Gallai type theorem for uniform hypergraphs
• General lemmas for Berge-Turán hypergraph problems
• On \(r\)-uniform hypergraphs with circumference less than \(r\)
• Avoiding long Berge cycles
• Asymptotics for the Turán number of Berge-\(K_{2,t}\)
• On maximal paths and circuits of graphs
• Extremal Results for Berge Hypergraphs
• Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs

This page was built for publication: Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2