On multicolor Ramsey numbers for loose $k$-paths of length three
Combinatorics
2017-03-29 v1
Abstract
We show that there exists an absolute constant such that for each and every coloring of the edges of the complete -uniform hypergraph on vertices with colors, one of the color classes contains a loose path of length three.
Cite
@article{arxiv.1703.09687,
title = {On multicolor Ramsey numbers for loose $k$-paths of length three},
author = {Tomasz Łuczak and Joanna Polcyn and Andrzej Ruciński},
journal= {arXiv preprint arXiv:1703.09687},
year = {2017}
}