A tree--arrowing graph
Eric C. Milner, Saharon Shelah
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.
Create a lesson
Related papers
Logarithmic--exponential preparation in sharply o-minimal structures
Gal Binyamini, Oded Carmon, Dmitry Novikov
Stoic Logic and Natural Term Logic
Clarence Lewis Protin
From raw Solvability Complexity Index proofs to Weihrauch degrees
Christopher Sorg
Existence of bases implies the axiom of choice, a foundation-free proof
Gabriel Fernandes, Renan Maneli Mezabarba, Vinicius de Oliveira Rodrigues
Every countable meet-continuous lattice is Scott sober
Xiaoquan Xu, Wei Ji
A minimal type of Morley rank ω in a partial differential field
Piotr Kowalski