The size-Ramsey number of 3-uniform tight paths

Abstract: Given a hypergraph

H

, the size-Ramsey number

h a t r_{2} (H)

is the smallest integer

m

such that there exists a graph

G

with

m

edges with the property that in any colouring of the edges of

G

with two colours there is a monochromatic copy of

H

. We prove that the size-Ramsey number of the

3

-uniform tight path on

n

vertices

P_{n}^{(3)}

is linear in

n

, i.e.,

h a t r_{2} (P_{n}^{(3)}) = O (n)

. This answers a question by Dudek, Fleur, Mubayi, and R"odl for

3

-uniform hypergraphs [On the size-Ramsey number of hypergraphs, J. Graph Theory 86 (2016), 417-434], who proved

h a t r_{2} (P_{n}^{(3)}) = O (n^{3 / 2} l o g^{3 / 2} n)

.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: The size-Ramsey number of 3-uniform tight paths