Ramsey numbers of trails and circuits

2021/09/06 by Conlon, David, Tyomkyn, Mykhaylo · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2109.02633

Abstract

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²/9 +o(n²), which is asymptotically best possible.

Cited by

• Monochromatic components with many edges in random graphs

Related

• Multicolour bipartite Ramsey number of paths
• Improved bounds on the multicolor Ramsey numbers of paths and even cycles
• Generalized Ramsey numbers: forbidding paths with few colors
• Note on the multicolour size-Ramsey number for paths
• New lower bounds on the size-Ramsey number of a path