2 research outputs found
Ordered Size Ramsey Number of Paths
An ordered graph is a simple graph with an ordering on its vertices. Define
the ordered path to be the monotone increasing path with edges. The
ordered size Ramsey number is the minimum number for
which there exists an ordered graph with edges such that every
two-coloring of the edges of contains a red copy of or a blue copy of
. For , we show , where is an absolute constant. This problem is
motivated by the recent results of Buci\'c-Letzter-Sudakov and Letzter-Sudakov
for oriented graphs.Comment: 11 pages; the new version includes (as Theorem 1.3) an extension of
the main result to more than 2 color
A note on the size Ramsey number of powers of paths
Let be an integer such that is a prime power and let be a
connected graph on vertices with average degree at least and
, where is a constant. We prove that the size
Ramsey number for
all sufficiently large , where is a constant depending only on and
. In particular, for integers , and such that is a
prime power, we have that there exists a constant depending only on and
such that for all sufficiently large , where is the
power of . We also prove that for
sufficiently large . This result improves some results of Dudek and
Pra{\l}at (\emph{SIAM J. Discrete Math.}, 31 (2017), 2079--2092 and
\emph{Electron. J. Combin.}, 25 (2018), no.3, # P3.35).Comment: 9 pages, 1 figur