A tree--arrowing graph
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 =(2lambda)+ 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.