Stability of extremal connected hypergraphs avoiding Berge-paths
From MaRDI portal
Publication:6604682
DOI10.1007/978-3-030-83823-2_19MaRDI QIDQ6604682FDOQ6604682
Authors: Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Nika Salia, Máté Vizer 
Publication date: 13 September 2024
Cites Work
- On maximal paths and circuits of graphs
- The history of degenerate (bipartite) extremal graph problems
- Path Ramsey numbers in multicolorings
- Hypergraph extensions of the Erdős-Gallai theorem
- Stability in the Erdős-Gallai theorems on cycles and paths
- Title not available (Why is that?)
- Connected graphs without long paths
- An Erdős-Gallai type theorem for uniform hypergraphs
- On the maximum size of connected hypergraphs without a path of given length
- Avoiding long Berge cycles
- The structure of hypergraphs without long Berge cycles
- On 2-connected hypergraphs with no long 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)
