Ramsey numbers for trees

Details Ramsey numbers for trees Ramsey numbers for trees

2011-03-14

arxiv.org/abs/1103.2685v5

Mathematics

Combinatorics

11 pages

Scientific paper

For $n\ge 5$ let $T_n'$ denote the unique tree on $n$ vertices with $\Delta(T_n')=n-2$, and let $T_n^*=(V,E)$ be the tree on $n$ vertices with $V=\{v_0,v_1,...,$ $v_{n-1}\}$ and $E=\{v_0v_1,...,v_0v_{n-3},$ $v_{n-3}v_{n-2},v_{n-2}v_{n-1}\}$. In this paper we evaluate the Ramsey numbers $r(G_m,T_n')$ and $r(G_m,T_n^*)$, where $G_m$ is a connected graph of order $m$. As examples, for $n\ge 8$ we have $r(T_n',T_n^*)=r(T_n^*,T_n^*)=2n-5$, for $n>m\ge 7$ we have $r(K_{1,m-1},T_n^*)=m+n-3$ or $m+n-4$ according as $m-1\mid (n-3)$ or $m-1\nmid (n-3)$, for $m\ge 7$ and $n\ge (m-3)^2+2$ we have $r(T_m^*,T_n^*)=m+n-3$ or $m+n-4$ according as $m-1\mid (n-3)$ or $m-1\nmid (n-3)$.

Affiliated with

Also associated with

No associations

Rating

Ramsey numbers 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 Ramsey numbers for trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ramsey numbers for trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-259786