On multicolor Ramsey number for 3-paths of length three
Combinatorics
2016-11-28 v1
Abstract
We show that if we color the hyperedges of the complete -uniform complete graph on vertices with colors, then one of the color classes contains a loose path of length three.
Keywords
Cite
@article{arxiv.1611.08247,
title = {On multicolor Ramsey number for 3-paths of length three},
author = {Tomasz Łuczak and Joanna Polcyn},
journal= {arXiv preprint arXiv:1611.08247},
year = {2016}
}