On multicolor Ramsey numbers for loose k-paths of length three
Abstract
We show that there exists an absolute constant A such that for each k2 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.