The size Ramsey number of a directed path

Details The size Ramsey number of a directed path The size Ramsey number of a directed path

2010-05-27

arxiv.org/abs/1005.5171v1

Mathematics

Combinatorics

Scientific paper

Given a graph $H$, the size Ramsey number $r_e(H,q)$ is the minimal number $m$ for which there is a graph $G$ with $m$ edges such that every $q$-coloring of $G$ contains a monochromatic copy of $H$. We study the size Ramsey number of the directed path of length $n$ in oriented graphs, where no antiparallel edges are allowed. We give nearly tight bounds for every fixed number of colors, showing that for every $q\geq 1 $ there are constants $c_1 = c_1(q),c_2$ such that $$\frac{c_1(q) n^{2q}(\log n)^{1/q}}{(\log\log n)^{(q+2)/q}} \leq r_e(\overrightarrow{P_n},q+1) \leq c_2 n^{2q}(\log {n})^2.$$ Our results show that the path size Ramsey number in oriented graphs is asymptotically larger than the path size Ramsey number in general directed graphs. Moreover, the size Ramsey number of a directed path is polynomially dependent in the number of colors, as opposed to the undirected case. Our approach also gives tight bounds on $r_e(\overrightarrow{P_n},q)$ for general directed graphs with $q \geq 3$, extending previous results.

Affiliated with

Also associated with

No associations

Rating

The size Ramsey number of a directed path 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 size Ramsey number of a directed path, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The size Ramsey number of a directed path will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-15263