Library Header Image
LSE Research Online LSE Library Services

The tripartite Ramsey number for trees

Böttcher, Julia, Hladký, Jan and Piguet, Diana (2009) The tripartite Ramsey number for trees. Electronic Notes in Discrete Mathematics, 34. pp. 597-601. ISSN 1571-0653

Full text not available from this repository.
Identification Number: 10.1016/j.endm.2009.07.101


We prove that for every ε>0 there are α>0 and n0∈N 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 k⩽(3−ε)n/2 and with maximum degree Δ(T)⩽nα. This answers a conjecture of Schelp.

Item Type: Article
Official URL:
Additional Information: © 2009 Elsevier B.V.
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 28 May 2012 15:21
Last Modified: 20 Jun 2021 01:43

Actions (login required)

View Item View Item