A Mathon-type construction for digraphs and improved lower bounds for Ramsey numbers

Abstract

We construct an edge-colored digraph analogous to Mathon's construction for undirected graphs. We show that this graph is connected to the $k$-th power Paley digraphs and we use this connection to produce improved lower bounds for multicolor directed Ramsey numbers.