Stability of extremal connected hypergraphs avoiding Berge-paths

DOI10.1007/978-3-030-83823-2_19MaRDI QIDQ6604682zbMATH OpenFDO

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

Publication date 13 September 2024

Full work available at URL https://doi.org/10.1007/978-3-030-83823-2_19

zbMATH Keywords

Berge-pathsconnectivityextremal hypergraph theory

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites work

• An Erdős-Gallai type theorem for uniform hypergraphs
• Avoiding long Berge cycles
• Connected graphs without long paths
• scientific article; zbMATH DE number 3652374 (Why is no real title available?)
• Hypergraph extensions of the Erdős-Gallai theorem
• On 2-connected hypergraphs with no long cycles
• On maximal paths and circuits of graphs
• On the maximum size of connected hypergraphs without a path of given length
• Path Ramsey numbers in multicolorings
• Stability in the Erdős-Gallai theorems on cycles and paths
• The history of degenerate (bipartite) extremal graph problems
• The structure of hypergraphs without long Berge cycles

This page was built for publication: Stability of extremal connected hypergraphs avoiding Berge-paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604682)