Avoiding long Berge cycles. II: Exact bounds for all \(n\)
From MaRDI portal
Publication:2041695
DOI10.4310/JOC.2021.V12.N2.A4zbMath1468.05131arXiv1807.06119OpenAlexW3186142988MaRDI QIDQ2041695
Ruth Luo, Alexandr V. Kostochka, Zoltan Fueredi
Publication date: 23 July 2021
Published in: Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.06119
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Extremal set theory (05D05) Distance in graphs (05C12)
Related Items (1)
On Hamiltonian Berge cycles in [3-uniform hypergraphs]
This page was built for publication: Avoiding long Berge cycles. II: Exact bounds for all \(n\)
