Extremal problems, partition theorems, symmetric hypergraphs

Joel Spencer

doi:10.1007/BF02579336

Extremal problems, partition theorems, symmetric hypergraphs

Joel Spencer

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	303-307
Number of pages	5
Journal	Combinatorica
Volume	1
Issue number	3
DOIs	https://doi.org/10.1007/BF02579336
State	Published - Sep 1981

Keywords

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

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Computational Mathematics

Access to Document

10.1007/BF02579336

Cite this

@article{6593ff6c3f01468c87cbf66b0365bee5,

title = "Extremal problems, partition theorems, symmetric hypergraphs",

abstract = "We compare extremal theorems such as Tur{\'a}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.",

keywords = "AMS subject classification (1980): 05C65, 60C05, 05C35",

author = "Joel Spencer",

year = "1981",

month = sep,

doi = "10.1007/BF02579336",

language = "English (US)",

volume = "1",

pages = "303--307",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "3",

}

TY - JOUR

T1 - Extremal problems, partition theorems, symmetric hypergraphs

AU - Spencer, Joel

PY - 1981/9

Y1 - 1981/9

N2 - 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.

AB - 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.

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

UR - http://www.scopus.com/inward/record.url?scp=51649159370&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51649159370&partnerID=8YFLogxK

U2 - 10.1007/BF02579336

DO - 10.1007/BF02579336

M3 - Article

AN - SCOPUS:51649159370

SN - 0209-9683

VL - 1

SP - 303

EP - 307

JO - Combinatorica

JF - Combinatorica

IS - 3

ER -

Extremal problems, partition theorems, symmetric hypergraphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this