The tripartite Ramsey number for trees

Details The tripartite Ramsey number for trees The tripartite Ramsey number for trees

2009-04-22

arxiv.org/abs/0904.3433v1

Mathematics

Combinatorics

25 pages

Scientific paper

We prove that for all epsilon>0 there are c>0 and n_0 such that for all n>n_0
the following holds. For any two-colouring of the edges of $K_{n,n,n}$ one
colour contains copies of all trees T of order t<(3-epsilon)n/2 and with
maximum degree at most n^c. This confirms a conjecture of Schelp.

Affiliated with

Also associated with

No associations

Rating

The tripartite Ramsey number for trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The tripartite Ramsey number for trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The tripartite Ramsey number for trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-275002