A tree--arrowing graph
Logic
2008-02-03 v1
Abstract
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.
Cite
@article{arxiv.math/9708210,
title = {A tree--arrowing graph},
author = {Eric C. Milner and Saharon Shelah},
journal= {arXiv preprint arXiv:math/9708210},
year = {2008}
}