A Mathon-type construction for digraphs and improved lower bounds for Ramsey numbers
Combinatorics
2024-08-13 v2
Abstract
We construct an edge-colored digraph analogous to Mathon's construction for undirected graphs. We show that this graph is connected to the -th power Paley digraphs and we use this connection to produce improved lower bounds for multicolor directed Ramsey numbers.
Keywords
Cite
@article{arxiv.2408.04067,
title = {A Mathon-type construction for digraphs and improved lower bounds for Ramsey numbers},
author = {Dermot McCarthy and Chris Monico},
journal= {arXiv preprint arXiv:2408.04067},
year = {2024}
}
Comments
Corrected typo from V1