A tree--arrowing graph
| dc.creator | Milner, Eric C. | |
| dc.creator | Shelah, Saharon | |
| dc.date | 1997-08-15 | |
| dc.date.accessioned | 2026-07-07T09:15:49Z | |
| dc.date.available | 2026-07-07T09:15:49Z | |
| dc.description | We answer a variant of a question of Rodl and Voigt by showing that, for a given infinite cardinal lambda, there is a graph G of cardinality kappa =(2^lambda)^+ such that for any colouring of the edges of G with lambda colours, there is an induced copy of the kappa-tree in G in the set theoretic sense with all edges having the same colour. | |
| dc.identifier | https://arxiv.org/abs/math/9708210 | |
| dc.identifier | http://arxiv.org/abs/math/9708210 | |
| dc.identifier | in: {Set theory (Curac{c}ao, 1995; Barcelona, 1996)} (1998) 175--182 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/153147 | |
| dc.subject | Logic | |
| dc.title | A tree--arrowing graph | |
| dc.type | text |