Finite subgraphs of uncountably chromatic graphs
| dc.creator | Komjáth, Péter | |
| dc.creator | Shelah, Saharon | |
| dc.date | 2002-12-04 | |
| dc.date.accessioned | 2026-07-07T04:53:32Z | |
| dc.date.available | 2026-07-07T04:53:32Z | |
| dc.description | It is consistent that for every monotonically increasing function f:omega->omega there is a graph with size and chromatic number aleph_1 in which every n-chromatic subgraph has at least f(n) elements (n >= 3). This solves a $250 problem of Erdos. It is also consistent that there is a graph X with Chr(X)=|X|= aleph_1 such that if Y is a graph all whose finite subgraphs occur in X then Chr(Y)<=aleph_2 (so the Taylor conjecture may fail). | |
| dc.identifier | https://arxiv.org/abs/math/0212064 | |
| dc.identifier | http://arxiv.org/abs/math/0212064 | |
| dc.identifier | J. Graph Theory 49 No. 1 (2005) 28--38 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/65887 | |
| dc.subject | Logic | |
| dc.title | Finite subgraphs of uncountably chromatic graphs | |
| dc.type | text |