Stability of extremal connected hypergraphs avoiding Berge-paths

DOI10.1016/j.ejc.2024.103930arXiv2008.02780WikidataQ128747875 ScholiaQ128747875MaRDI QIDQ6201910

Dániel Gerbner, Máté Vizer, Nika Salia, Balázs Patkós, Dániel T. Nagy

Publication date: 26 March 2024

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

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

zbMATH Keywords

hyperedges\(k\)-Berge-path

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Stability in the Erdős-Gallai theorems on cycles and paths
• 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
• The structure of hypergraphs without long Berge cycles
• Connected hypergraphs without long Berge-paths
• Avoiding long Berge cycles
• On 2-connected hypergraphs with no long cycles
• On maximal paths and circuits of graphs
• The History of Degenerate (Bipartite) Extremal Graph Problems