The Library
The tripartite Ramsey number for trees
Tools
Tools
Tools
Böttcher, Julia, Hladký, Jan and Piguet, Diana (2009) The tripartite Ramsey number for trees. Electronic Notes in Discrete Mathematics, Vol.34 . pp. 597-601. doi:10.1016/j.endm.2009.07.101
Research output not available from this repository, contact author.
Official URL: http://dx.doi.org/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: | Journal Article | ||||
|---|---|---|---|---|---|
| Divisions: | Faculty of Science > Mathematics | ||||
| Journal or Publication Title: | Electronic Notes in Discrete Mathematics | ||||
| Publisher: | Elsevier BV | ||||
| ISSN: | 1571-0653 | ||||
| Official Date: | 2009 | ||||
| Dates: |
|
||||
| Volume: | Vol.34 | ||||
| Page Range: | pp. 597-601 | ||||
| DOI: | 10.1016/j.endm.2009.07.101 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
