Graphs with Few 3-cliques and 3-anticliques are 3-universal

Nati Linial, Avraham Morgenstern

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


For given integers k, l we ask whether every large graph with a sufficiently small number of k-cliques and k-anticliques must contain an induced copy of every l-vertex graph. Here we prove this claim for k = l = 3 with a sharp bound. A similar phenomenon is established as well for tournaments with k = l = 4.

Original languageAmerican English
Pages (from-to)229-238
Number of pages10
JournalJournal of Graph Theory
Issue number3
StatePublished - 1 Mar 2015

Bibliographical note

Publisher Copyright:
© 2014 Wiley Periodicals, Inc.


  • Anticliques
  • Cliques
  • Erdos-Hajnal conjecture
  • Tournaments
  • Universality


Dive into the research topics of 'Graphs with Few 3-cliques and 3-anticliques are 3-universal'. Together they form a unique fingerprint.

Cite this