On \(r\)-uniform hypergraphs with circumference less than \(r\)

DOI10.1016/j.dam.2019.07.011zbMath1435.05153arXiv1807.04683OpenAlexW2965343580MaRDI QIDQ2309554

Ruth Luo, Alexandr V. Kostochka

Publication date: 1 April 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Turán problemextremal hypergraph theorycycles and paths

Mathematics Subject Classification ID

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

Related Items (14)

3-uniform hypergraphs without a cycle of length five ⋮ Longest cycles in 3‐connected hypergraphs and bipartite graphs ⋮ Exact bipartite Turán numbers of large even cycles ⋮ Super-pancyclic hypergraphs and bipartite graphs ⋮ Conditions for a bigraph to be super-cyclic ⋮ On the cover Turán number of Berge hypergraphs ⋮ General lemmas for Berge-Turán hypergraph problems ⋮ The structure of hypergraphs without long Berge cycles ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Connected hypergraphs without long Berge-paths ⋮ Avoiding long Berge cycles ⋮ Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2 ⋮ On the cover Ramsey number of Berge hypergraphs ⋮ On 2-connected hypergraphs with no long cycles

Cites Work

• Unnamed Item
• Stability in the Erdős-Gallai theorems on cycles and paths
• Hypergraph extensions of the Erdős-Gallai theorem
• On maximal circuits in directed graphs
• Path Ramsey numbers in multicolorings
• The structure of hypergraphs without long Berge cycles
• Avoiding long Berge cycles
• On maximal paths and circuits of graphs
• Maximal circuits of graphs. I

This page was built for publication: On \(r\)-uniform hypergraphs with circumference less than \(r\)