Extremal problems, partition theorems, symmetric hypergraphs


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.

This is a preview of subscription content, access via your institution.


  1. [1]

    L. Lovász, On the ratio of optimal integral and fractional covers,Discrete Math. 13 (1975), 383–390.

    MATH  Article  MathSciNet  Google Scholar 

  2. [2]

    J. Spencer, Puncture Sets,J. Comb. Th. (A) 17 (1974), 329–336.

    MATH  Article  Google Scholar 

Download references

Author information



Rights and permissions

Reprints and Permissions

About this article

Cite this article

Spencer, J. Extremal problems, partition theorems, symmetric hypergraphs. Combinatorica 1, 303–307 (1981). https://doi.org/10.1007/BF02579336

Download citation

AMS subject classification (1980)

  • 05 C 65
  • 60 C 05
  • 05 C 35