The maximum number of q-cliques in a graph with no p-clique
From MaRDI portal
Publication:1222664
DOI10.1016/0012-365X(76)90069-8zbMATH Open0319.05126OpenAlexW2011504778MaRDI QIDQ1222664
Publication date: 1976
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(76)90069-8
Cites Work
Related Items (14)
Another extremal problem for Turan graphs ⋮ Intersection properties of boxes. I: An upper-bound theorem ⋮ Maximizing the number of independent sets of fixed size in connected graphs with given independence number ⋮ Many triangles with few edges ⋮ The maximum number of complete subgraphs in a graph with given maximum degree ⋮ Independent sets in graphs ⋮ Many cliques with few edges and bounded maximum degree ⋮ The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs ⋮ On the maximum number of maximum independent sets ⋮ On the maximum number of cliques in a graph ⋮ On the generalized Turán problem for odd cycles ⋮ Unnamed Item ⋮ A new Turán-type theorem for cliques in graphs ⋮ The maximum number of cliques in dense graphs
This page was built for publication: The maximum number of q-cliques in a graph with no p-clique
