On the maximum size of connected hypergraphs without a path of given length

DOI10.1016/j.disc.2018.06.006zbMath1392.05032arXiv1710.08364OpenAlexW2964297058MaRDI QIDQ724883

Abhishek Methuku, Nika Salia, Máté Vizer, Casey Tompkins, Ervin Gyoeri

Publication date: 26 July 2018

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

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

zbMATH Keywords

Erdős-Gallai theoremBerge hypergraphconnected hypergraph

Mathematics Subject Classification ID

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

Related Items (8)

Stability of extremal connected hypergraphs avoiding Berge-paths ⋮ $t$-Wise Berge and $t$-Heavy Hypergraphs ⋮ Connected hypergraphs without long Berge-paths ⋮ Ramsey Problems for Berge Hypergraphs ⋮ Extensions of the Erdős–Gallai theorem and Luo’s theorem ⋮ Asymptotics for the Turán number of Berge-\(K_{2,t}\) ⋮ Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2 ⋮ On 2-connected hypergraphs with no long cycles

Cites Work

• Unnamed Item
• Hypergraph extensions of the Erdős-Gallai theorem
• Connected graphs without long paths
• The maximum number of cliques in graphs without long cycles
• An Erdős-Gallai type theorem for uniform hypergraphs
• On maximal paths and circuits of graphs

This page was built for publication: On the maximum size of connected hypergraphs without a path of given length