On 2-connected hypergraphs with no long cycles
From MaRDI portal
Publication:2335701
zbMath1427.05150arXiv1901.11159MaRDI QIDQ2335701
Ruth Luo, Zoltan Fueredi, Alexandr V. Kostochka
Publication date: 15 November 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.11159
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Paths and cycles (05C38) Extremal set theory (05D05) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Related Items (2)
Stability of extremal connected hypergraphs avoiding Berge-paths ⋮ Connected hypergraphs without long Berge-paths
Cites Work
- Unnamed Item
- Unnamed Item
- On the maximum size of connected hypergraphs without a path of given length
- Hypergraph extensions of the Erdős-Gallai theorem
- On maximal circuits in directed graphs
- The maximum number of cliques in graphs without long cycles
- An Erdős-Gallai type theorem for uniform hypergraphs
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
- Path Ramsey numbers in multicolorings
- The structure of hypergraphs without long Berge cycles
- On \(r\)-uniform hypergraphs with circumference less than \(r\)
- Avoiding long Berge cycles
- A variation of a theorem by Pósa
- On maximal paths and circuits of graphs
- Long paths and large cycles in finite graphs
- Maximal circuits of graphs. I
- The History of Degenerate (Bipartite) Extremal Graph Problems
This page was built for publication: On 2-connected hypergraphs with no long cycles
