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
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.
|Additional Information:||© 2009 Elsevier B.V.|
|Library of Congress subject classification:||Q Science > QA Mathematics|
|Sets:||Departments > Mathematics|
|Date Deposited:||28 May 2012 15:21|
Actions (login required)
|Record administration - authorised staff only|