On the densities of cliques and independent sets in graphs

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

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

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 languageEnglish (US)
Pages (from-to)493-512
Number of pages20
JournalCombinatorica
Volume36
Issue number5
DOIs
StatePublished - Oct 1 2016

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

Cite this