Cookies?
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.

Abstract

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: http://www.elsevier.com/wps/find/journaldescriptio...
Additional Information: © 2009 Elsevier B.V.
Library of Congress subject classification: Q Science > QA Mathematics
Sets: Departments > Mathematics
Rights: http://www.lse.ac.uk/library/usingTheLibrary/academicSupport/OA/depositYourResearch.aspx
Date Deposited: 28 May 2012 15:21
URL: http://eprints.lse.ac.uk/44107/

Actions (login required)

Record administration - authorised staff only Record administration - authorised staff only