A Ramsey-style extension of a theorem of Erdős and Hajnal (Q2773241)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1709829
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Ramsey-style extension of a theorem of Erdős and Hajnal |
scientific article; zbMATH DE number 1709829 |
Statements
A Ramsey-style extension of a theorem of Erdős and Hajnal (English)
0 references
21 February 2002
0 references
\(n\)-chromatic graph
0 references
The author proves: If \(n\) and \(t\) are natural numbers, \(\mu\) an infinite cardinal and \(G\) an \(n\)-chromatic graph of cardinality at most \(\mu\), then there is a graph \(X\) with \(X\to (G)^1_\mu\) and \(|X|= \mu^+\) such that every subgraph of \(X\) of cardinality less than \(t\) is \(n\)-colorable.
0 references
0.7883971333503723
0 references
0.7866179943084717
0 references
0.7825896739959717
0 references
0.7818215489387512
0 references
