An Erdős-Gallai type theorem for uniform hypergraphs

DOI10.1016/j.ejc.2017.10.006zbMath1376.05099arXiv1608.03241OpenAlexW2766481075MaRDI QIDQ1686258

Abhishek Methuku, Akbar Davoodi, Casey Tompkins, Ervin Gyoeri

Publication date: 21 December 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(r\)-uniform hypergraphmaximum number of hyperedges

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (21)

Turán numbers for hypergraph star forests ⋮ Turán numbers of Berge trees ⋮ On Ramsey numbers of 3-uniform Berge cycles ⋮ Stability of extremal connected hypergraphs avoiding Berge-paths ⋮ Extremal Results for Berge Hypergraphs ⋮ 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 ⋮ Turán numbers for Berge-hypergraphs and related extremal problems ⋮ Saturation of Berge hypergraphs ⋮ On the maximum size of connected hypergraphs without a path of given length ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Connected hypergraphs without long Berge-paths ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Avoiding long Berge cycles ⋮ Asymptotics for the Turán number of Berge-\(K_{2,t}\) ⋮ Counting copies of a fixed subgraph in \(F\)-free graphs ⋮ Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2 ⋮ Minimum degree of 3-graphs without long linear paths ⋮ On the cover Ramsey number of Berge hypergraphs ⋮ On 2-connected hypergraphs with no long cycles

Cites Work

• Hypergraph extensions of the Erdős-Gallai theorem
• On maximal paths and circuits of graphs

This page was built for publication: An Erdős-Gallai type theorem for uniform hypergraphs