Stability of extremal connected hypergraphs avoiding Berge-paths
From MaRDI portal
Publication:6604682
DOI10.1007/978-3-030-83823-2_19MaRDI QIDQ6604682
Could not fetch data.
Publication date: 13 September 2024
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- 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
- 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
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)
