| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903575 | European Journal of Combinatorics | 2018 | 8 Pages |
Abstract
We show that there exists an absolute constant A such that for each kâ¥2 and every coloring of the edges of the complete k-uniform hypergraph on Ar vertices with r colors, râ¥rk, one of the color classes contains a loose path of length three.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Tomasz Åuczak, Joanna Polcyn, Andrzej RuciÅski,