A generalization of a theorem of Turán
From MaRDI portal
Publication:2545883
DOI10.1016/0095-8956(71)90071-2zbMath0216.02503OpenAlexW2037520118MaRDI QIDQ2545883
Publication date: 1971
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(71)90071-2
Related Items
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, On the maximal number of certain subgraphs in \(K_ r\)-free graphs, 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, Bounds on the number of complete subgraphs, On the triangle clique cover and \(K_t\) clique cover problems, On the maximum number of cliques in a graph, On Turan hypergraphs, A new Turán-type theorem for cliques in graphs
Cites Work
