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

Identification Number: 10.1016/j.endm.2009.07.101

## 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. |

Divisions: | Mathematics |

Subjects: | Q Science > QA Mathematics |

Sets: | Departments > Mathematics |

Date Deposited: | 28 May 2012 15:21 |

Last Modified: | 20 Feb 2021 04:22 |

URI: | http://eprints.lse.ac.uk/id/eprint/44107 |

### Actions (login required)

View Item |