Inverse Turán numbers
From MaRDI portal
Publication:2113336
DOI10.1016/j.disc.2021.112779zbMath1484.05104arXiv2007.07042OpenAlexW4205114494MaRDI QIDQ2113336
Casey Tompkins, Oscar Zamora, Nika Salia, Ervin Gyoeri
Publication date: 14 March 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.07042
Related Items (3)
LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS ⋮ Random polynomial graphs for random Turán problems ⋮ Inverting the Turán problem with chromatic number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connected graphs without long paths
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- Norm-graphs: Variations and applications
- Inverting the Turán problem
- Norm-graphs and bipartite Turán numbers
- ExtremalC4-Free/C5-Free Planar Graphs
- On maximal paths and circuits of graphs
- Large Subgraphs without Short Cycles
- An extremal problem for paths in bipartite graphs
- A new series of dense graphs of high girth
- Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree
- The History of Degenerate (Bipartite) Extremal Graph Problems
- On Graphs that do not Contain a Thomsen Graph
- A Note on Bipartite Graphs Without 2 k -Cycles
- Some Theorems on Abstract Graphs
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
This page was built for publication: Inverse Turán numbers