# Sh:578

• Milner, E. C., & Shelah, S. (1998). A tree-arrowing graph. In Set theory (Curaçao, 1995; Barcelona, 1996), Kluwer Acad. Publ., Dordrecht, pp. 175–182.
• Abstract:
We answer a variant of a question of Rödl 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.
@incollection{Sh:578,
}