Ramsey numbers of trails and circuits

preprint2022arXivOpen access

We show that every two-colouring of the edges of the complete graph $K_n$ contains a monochromatic trail or circuit of length at least $2n^2/9 +o(n^2)$ , which is asymptotically best possible.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Ramsey numbers of trails and circuits

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0