On the densities of cliques and independent sets in graphs

Hao Huang*, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


Let r; s≥2 be integers. Suppose that the number of blue r-cliques in a red/blue coloring of the edges of the complete graph Kn is known and fixed. What is the largest possible number of red s-cliques under this assumption? The well known Kruskal-Katona theorem answers this question for r = 2 or s = 2. Using the shifting technique from extremal set theory together with some analytical arguments, we resolve this problem in general and prove that in the extremal coloring either the blue edges or the red edges form a clique.

Original languageAmerican English
Pages (from-to)493-512
Number of pages20
Issue number5
StatePublished - 1 Oct 2016

Bibliographical note

Publisher Copyright:
© 2016, János Bolyai Mathematical Society and Springer-Verlag Berlin Heidelberg.


Dive into the research topics of 'On the densities of cliques and independent sets in graphs'. Together they form a unique fingerprint.

Cite this