Linearity of saturation for Berge hypergraphs
From MaRDI portal
Publication:2422222
DOI10.1016/j.ejc.2019.02.002zbMath1414.05208arXiv1807.06947OpenAlexW2884803781WikidataQ128287043 ScholiaQ128287043MaRDI QIDQ2422222
Dániel Gerbner, Abhishek Methuku, Michael Tait, Sean English
Publication date: 18 June 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.06947
Related Items
On saturation of Berge hypergraphs, Nearly-Regular Hypergraphs and Saturation of Berge Stars, Saturation for the 3-uniform loose 3-cycle, Saturation numbers for Berge cliques, Saturation number of Berge stars in random hypergraphs, A note on saturation for Berge-\(G\) hypergraphs, Hypergraph based Berge hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Turán problems and shadows. II: Trees
- Turán problems and shadows. I: Paths and cycles
- A survey of minimum saturated graphs
- Hypergraph extensions of the Erdős-Gallai theorem
- On hypergraphs of girth five
- On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
- What we know and what we do not know about Turán numbers
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Saturation spectrum of paths and stars
- A hypergraph extension of Turán's theorem
- Hypergraphs with No Cycle of a Given Length
- Saturated graphs with minimal number of edges
- Edge-colored saturated graphs
- Colored Saturation Parameters for Rainbow Subgraphs
- Weakly P-saturated graphs
- The Minimum Size of Saturated Hypergraphs
- Nearly-Regular Hypergraphs and Saturation of Berge Stars
- Turán Problems and Shadows III: Expansions of Graphs
- A Problem in Graph Theory
- Saturation in random graphs
- Extremal Results for Berge Hypergraphs
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Graph saturation in multipartite graphs
