Monochromatic Paths in the Complete Symmetric Infinite Digraph

Publication date: 30 October 2017

Abstract: Let

v e c K_{m a t h b b 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

v e c K_{m a t h b b 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

f r a c 1 r

.

This page was built for publication: Monochromatic Paths in the Complete Symmetric Infinite Digraph