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.
- AMS subject classification (1980): 05C65, 60C05, 05C35
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics