Ramsey numbers of trails and circuits
Abstract
We show that every two-colouring of the edges of the complete graph Kn contains a monochromatic trail or circuit of length at least 2n2/9 +o(n2), which is asymptotically best possible.
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.