A Mathon-Type Construction for Digraphs and Improved Lower Bounds for Ramsey Numbers

  • Dermot McCarthy
  • Chris Monico
DOI: https://doi.org/10.37236/13294

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.

Published
2025-06-06
How to Cite
McCarthy, D., & Monico, C. (2025). A Mathon-Type Construction for Digraphs and Improved Lower Bounds for Ramsey Numbers. The Electronic Journal of Combinatorics, 32(2), P2.42. https://doi.org/10.37236/13294
Issue
Volume 32, Issue 2 (2025)
Article Number
P2.42