Monochromatic Paths in the Complete Symmetric Infinite Digraph

Abstract

Let ${\vec{K}}_{\mathbb{N}}$ be the complete symmetric digraph on the positive integers. Answering a question of DeBiasio and McKenney, we construct a 2-colouring of the edges of ${\vec{K}}_{\mathbb{N}}$ in which every monochromatic path has density 0. On the other hand, we show that, in every colouring that does not have a directed path with $r$ edges in the first colour, there is directed path in the second colour with density at least $\frac{1}{r}$.

Cited by in corpus (1)

• Decomposing edge-coloured complete symmetric digraphs into monochromatic paths