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 1981

Fingerprint

Extremal Problems
Hypergraph
Partition
Theorem
Ramsey's Theorem
Ramsey number
Independence number
Chromatic number

Keywords

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

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Mathematics(all)

Cite this

Extremal problems, partition theorems, symmetric hypergraphs. / Spencer, Joel.

In: Combinatorica, Vol. 1, No. 3, 09.1981, p. 303-307.

Research output: Contribution to journalArticle

@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 = "9",
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

VL - 1

SP - 303

EP - 307

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 3

ER -