1-color-avoiding paths, special tournaments, and incidence geometry

Jonathan Tidor, Victor Y. Wang, Ben Yang

We discuss two approaches to a recent question of Loh: must a 3-colored transitive tournament on $N$ vertices have a 1-color-\emph{avoiding} path of vertex-length at least $N^{2/3}…