A generalization of a theorem of Turán

DOI10.1016/0095-8956(71)90071-2MaRDI QIDQ2545883zbMATH OpenOpenAlexFDO

Authors Norbert Sauer

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites work

• scientific article; zbMATH DE number 3185004 (Why is no real title available?)
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On the theory of graphs

Cited in

(12)

• Many triangles with few edges
• On Turan hypergraphs
• Maximizing the number of independent sets of fixed size in connected graphs with given independence number
• Many cliques with few edges and bounded maximum degree
• Independent sets in graphs
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• Bounds on the number of complete subgraphs
• On the maximum number of cliques in a graph
• On the triangle clique cover and \(K_t\) clique cover problems
• The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs
• A new Turán-type theorem for cliques in graphs
• The maximum number of complete subgraphs in a graph with given maximum degree

This page was built for publication: A generalization of a theorem of Turán

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2545883)