Connected hypergraphs without long Berge-paths

DOI10.1016/j.ejc.2021.103353zbMath1466.05150arXiv1910.01322OpenAlexW3160719424MaRDI QIDQ2033897

Nika Salia, Oscar Zamora, Ervin Gyoeri

Publication date: 18 June 2021

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

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

zbMATH Keywords

hyperedges\(k\)-Berge-path

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Connectivity (05C40)

Related Items

Stability of extremal connected hypergraphs avoiding 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
• Connected graphs without long paths
• An Erdős-Gallai type theorem for uniform hypergraphs
• Path Ramsey numbers in multicolorings
• General lemmas for Berge-Turán hypergraph problems
• The structure of hypergraphs without long Berge cycles
• On \(r\)-uniform hypergraphs with circumference less than \(r\)
• Avoiding long Berge cycles
• On 2-connected hypergraphs with no long cycles
• On maximal paths and circuits of graphs