On the connection between chromatic number, maximal clique and minimal degree of a graph

B. Andrásfai, P. Erdös, V. T. Sós

Research output: Contribution to journalArticle

92 Citations (Scopus)

Abstract

Let Gn be a graph of n vertices, having chromatic number r which contains no complete graph of r vertices. Then Gn contains a vertex of degree not exceeding n(3r-7)/(3r-4). The result is essentially best possible.

Original languageEnglish
Pages (from-to)205-218
Number of pages14
JournalDiscrete Mathematics
Volume8
Issue number3
DOIs
Publication statusPublished - May 1974

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'On the connection between chromatic number, maximal clique and minimal degree of a graph'. Together they form a unique fingerprint.

  • Cite this