Ramsey numbers of trails and circuits
arXiv:2109.02633
Abstract
We show that every two-colouring of the edges of the complete graph contains a monochromatic trail or circuit of length at least , which is asymptotically best possible.
3 pages
arXiv:2109.02633
We show that every two-colouring of the edges of the complete graph contains a monochromatic trail or circuit of length at least , which is asymptotically best possible.
3 pages