On Turán's theorem for sparse graphs

M. Ajtai, P. Erdős, J. Komlós, E. Szemerédi

Research output: Contribution to journalArticle

37 Citations (Scopus)

Abstract

For a graph G with n vertices and average valency t, Turán's theorem yields the inequality α≧n/(t+1) where α denotes the maximum size of an independent set in G. We improve this bound for graphs containing no large cliques.

Original languageEnglish
Pages (from-to)313-317
Number of pages5
JournalCombinatorica
Volume1
Issue number4
DOIs
Publication statusPublished - Dec 1981

    Fingerprint

Keywords

  • AMS subject classification (1980): 05C35, 05C55

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Cite this