The Library
The tripartite Ramsey number for trees
Tools
Tools
Tools
Böttcher, Julia, Hladký, Jan and Piguet, Diana (2012) The tripartite Ramsey number for trees. Journal of Graph Theory, Vol.69 (No.3). pp. 264-300. doi:10.1002/jgt.20582
Research output not available from this repository, contact author.
Official URL: http://dx.doi.org/10.1002/jgt.20582
Abstract
We prove that for all εμ>0 there are α>0 and n 0εℕ such that for all n≥n 0 the following holds. For any two-coloring of the edges of K n, n, n one color contains copies of all trees T of order t≤(3 - εμ)n/2 and with maximum degree δ(T)≤n α. This confirms a conjecture of Schelp. © 2012 Wiley Periodicals, Inc.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics | ||||
| Divisions: | Faculty of Science > Mathematics | ||||
| Journal or Publication Title: | Journal of Graph Theory | ||||
| Publisher: | John Wiley & Sons Ltd. | ||||
| ISSN: | 0364-9024 | ||||
| Official Date: | March 2012 | ||||
| Dates: |
|
||||
| Volume: | Vol.69 | ||||
| Number: | No.3 | ||||
| Page Range: | pp. 264-300 | ||||
| DOI: | 10.1002/jgt.20582 | ||||
| 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 |
