The tripartite Ramsey number for trees
Abstract
We prove that for all epsilon>0 there are c>0 and n0 such that for all n>n0 the following holds. For any two-colouring of the edges of Kn,n,n one colour contains copies of all trees T of order t<(3-epsilon)n/2 and with maximum degree at most nc. This confirms a conjecture of Schelp.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.