Turán's theorem inverted
From MaRDI portal
Publication:1045153
DOI10.1016/j.disc.2009.08.004zbMath1229.05149arXiv0707.3394OpenAlexW2092224707MaRDI QIDQ1045153
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0707.3394
Related Items
Large joints in graphs ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs with many copies of a given subgraph
- Complete \(r\)-partite subgraphs of dense \(r\)-graphs
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Joints in graphs
- On a valence problem in extremal graph theory
- On the structure of linear graphs
- Graphs with many r -cliques have large complete r -partite subgraphs