Extremal problems, partition theorems, symmetric hypergraphs

Research output: Contribution to journalArticle

Abstract

We compare extremal theorems such as Turán's theorem with their corresponding partition theorems such as Ramsey's theorem. We derive a general inequality involving chromatic number and independence number of symmetric hypergraphs. We give applications to Ramsey numbers and to van der Waerden numbers.

Original languageEnglish (US)
Pages (from-to)303-307
Number of pages5
JournalCombinatorica
Volume1
Issue number3
DOIs
StatePublished - Sep 1 1981

    Fingerprint

Keywords

  • AMS subject classification (1980): 05C65, 60C05, 05C35

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Cite this