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

2024/08/07 by McCarthy, Dermot, Monico, Chris · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2408.04067

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.

Cited by

• Random-projector quantum diagnostics of Ramsey numbers and a prime-factor heuristic for R(5,5)=45

Related

• An improved lower bound on multicolor Ramsey numbers
• Lower bounds for multicolor Ramsey numbers
• An improved lower bound for multicolor Ramsey numbers and the\n half-multiplicity Ramsey number problem
• New Lower Bounds for Some Multicolored Ramsey Numbers
• Recent developments in graph Ramsey theory