Turán's theorem inverted
From MaRDI portal
Publication:1045153
DOI10.1016/J.DISC.2009.08.004zbMATH Open1229.05149arXiv0707.3394OpenAlexW2092224707MaRDI QIDQ1045153FDOQ1045153
Authors: Vladimir Nikiforov 
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: Turan's theorem implies that every graph of order n with more edges than the r-partite Turan graph contains a complete graph of order r+1. We show that the same premise implies the existence of much larger graphs. We also prove corresponding stability theorems. These results complete work started by Erdos in 1963.
Full work available at URL: https://arxiv.org/abs/0707.3394
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Title not available (Why is that?)
- On a valence problem in extremal graph theory
- Joints in graphs
- On the structure of linear graphs
- Graphs with many r -cliques have large complete r -partite subgraphs
- Graphs with many copies of a given subgraph
- Complete \(r\)-partite subgraphs of dense \(r\)-graphs
Cited In (8)
- Extremal problems for the \(p\)-spectral radius of graphs
- Stability for large forbidden subgraphs
- Sharp bounds for the signless Laplacian spectral radius in terms of clique number
- Spectral saturation: inverting the spectral Turán theorem
- Inverse Turán numbers
- Large joints in graphs
- A Density Turán Theorem
- Turán, involution and shifting
This page was built for publication: Turán's theorem inverted
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045153)
