On multicolor Ramsey numbers for loose k-paths of length three
classification
🧮 math.CO
keywords
lengthloosethreeabsoluteclassescolorcoloringcolors
read the original abstract
We show that there exists an absolute constant $A$ such that for each $k\ge2$ and every coloring of the edges of the complete $k$-uniform hypergraph on $ Ar$ vertices with $r$ colors, one of the color classes contains a loose path of length three.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.