# A Ramsey-style extension of a theorem of Erdős and Hajnal

Fundamenta Mathematicae (2001)

- Volume: 170, Issue: 1-2, page 119-122
- ISSN: 0016-2736

## Access Full Article

top## Abstract

top## How to cite

topPeter Komjáth. "A Ramsey-style extension of a theorem of Erdős and Hajnal." Fundamenta Mathematicae 170.1-2 (2001): 119-122. <http://eudml.org/doc/282179>.

@article{PeterKomjáth2001,

abstract = {If n, t are natural numbers, μ is an infinite cardinal, G is an n-chromatic graph of cardinality at most μ, then there is a graph X with $X → (G)¹_μ$, |X| = μ⁺, such that every subgraph of X of cardinality < t is n-colorable.},

author = {Peter Komjáth},

journal = {Fundamenta Mathematicae},

keywords = {-chromatic graph},

language = {eng},

number = {1-2},

pages = {119-122},

title = {A Ramsey-style extension of a theorem of Erdős and Hajnal},

url = {http://eudml.org/doc/282179},

volume = {170},

year = {2001},

}

TY - JOUR

AU - Peter Komjáth

TI - A Ramsey-style extension of a theorem of Erdős and Hajnal

JO - Fundamenta Mathematicae

PY - 2001

VL - 170

IS - 1-2

SP - 119

EP - 122

AB - If n, t are natural numbers, μ is an infinite cardinal, G is an n-chromatic graph of cardinality at most μ, then there is a graph X with $X → (G)¹_μ$, |X| = μ⁺, such that every subgraph of X of cardinality < t is n-colorable.

LA - eng

KW - -chromatic graph

UR - http://eudml.org/doc/282179

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.