On multicolor Ramsey number for 3-paths of length three
Abstract
We show that if we color the hyperedges of the complete 3-uniform complete graph on 2n+18n+1+2 vertices with n colors, then 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.