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.
Recommendations
Cites work
- Complete \(r\)-partite subgraphs of dense \(r\)-graphs
- Graphs with many r -cliques have large complete r -partite subgraphs
- Graphs with many copies of a given subgraph
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 3258858 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- Joints in graphs
- On a valence problem in extremal graph theory
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- On the structure of linear graphs
Cited in
(9)- Spectral saturation: inverting the spectral Turán theorem
- Inverse Turán numbers
- Turán, involution and shifting
- Stability for large forbidden subgraphs
- Sharp bounds for the signless Laplacian spectral radius in terms of clique number
- Extremal problems for the p-spectral radius of graphs
- A Density Turán Theorem
- Large joints in graphs
- Some Turán-type results for the signless Laplacian spectral radius
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)
