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.
Similar content being viewed by others
References
L. Lovász, On the ratio of optimal integral and fractional covers,Discrete Math. 13 (1975), 383–390.
J. Spencer, Puncture Sets,J. Comb. Th. (A) 17 (1974), 329–336.