A new Turán-type theorem for cliques in graphs
From MaRDI portal
Publication:1827735
DOI10.1016/j.disc.2003.11.007zbMath1042.05053OpenAlexW2079280338MaRDI QIDQ1827735
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.007
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (11)
Tree densities in sparse graph classes ⋮ Cliques in graphs excluding a complete graph minor ⋮ Many triangles with few edges ⋮ Face vectors of flag complexes ⋮ Independent sets in graphs ⋮ The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs ⋮ A Kruskal-Katona type theorem for graphs ⋮ Some sharp results on the generalized Turán numbers ⋮ On the maximum number of cliques in a graph ⋮ Flag complexes and homology ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The maximum number of q-cliques in a graph with no p-clique
- The maximum number of triangles in a \(K_4\)-free graph
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- A generalization of a theorem of Turán
- Shadows of colored complexes.
This page was built for publication: A new Turán-type theorem for cliques in graphs
