We show that if we color the hyperedges of the complete $3$-uniform hypergraph on $2n+\sqrt{18n+1}+2$ vertices with $n$ colors, then one of the color classes contains a loose path of length three.
@article{10_37236_6670,
author = {Tomasz {\L}uczak and Joanna Polcyn},
title = {On the multicolor {Ramsey} number for 3-paths of length three},
journal = {The electronic journal of combinatorics},
year = {2017},
volume = {24},
number = {1},
doi = {10.37236/6670},
zbl = {1355.05165},
url = {http://geodesic.mathdoc.fr/articles/10.37236/6670/}
}
TY - JOUR
AU - Tomasz Łuczak
AU - Joanna Polcyn
TI - On the multicolor Ramsey number for 3-paths of length three
JO - The electronic journal of combinatorics
PY - 2017
VL - 24
IS - 1
UR - http://geodesic.mathdoc.fr/articles/10.37236/6670/
DO - 10.37236/6670
ID - 10_37236_6670
ER -
%0 Journal Article
%A Tomasz Łuczak
%A Joanna Polcyn
%T On the multicolor Ramsey number for 3-paths of length three
%J The electronic journal of combinatorics
%D 2017
%V 24
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/6670/
%R 10.37236/6670
%F 10_37236_6670
Tomasz Łuczak; Joanna Polcyn. On the multicolor Ramsey number for 3-paths of length three. The electronic journal of combinatorics, Tome 24 (2017) no. 1. doi: 10.37236/6670
