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.
No takes yet. Share an insight, caveat, or question.
McCarthy et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: