A Mathon-type construction for digraphs and improved lower bounds for Ramsey numbers
The electronic journal of combinatorics, Tome 32 (2025) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/13294
Classification : 05C55, 05C15, 05C20
Mots-clés : edge-colored digraph, Paley digraphs

Dermot McCarthy  1   ; Chris Monico  1

1 Texas Tech University
@article{10_37236_13294,
     author = {Dermot McCarthy and Chris Monico},
     title = {A {Mathon-type} construction for digraphs and improved lower bounds for {Ramsey} numbers},
     journal = {The electronic journal of combinatorics},
     year = {2025},
     volume = {32},
     number = {2},
     doi = {10.37236/13294},
     zbl = {1569.05241},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/13294/}
}
TY  - JOUR
AU  - Dermot McCarthy
AU  - Chris Monico
TI  - A Mathon-type construction for digraphs and improved lower bounds for Ramsey numbers
JO  - The electronic journal of combinatorics
PY  - 2025
VL  - 32
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/13294/
DO  - 10.37236/13294
ID  - 10_37236_13294
ER  - 
%0 Journal Article
%A Dermot McCarthy
%A Chris Monico
%T A Mathon-type construction for digraphs and improved lower bounds for Ramsey numbers
%J The electronic journal of combinatorics
%D 2025
%V 32
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/13294/
%R 10.37236/13294
%F 10_37236_13294
Dermot McCarthy; Chris Monico. A Mathon-type construction for digraphs and improved lower bounds for Ramsey numbers. The electronic journal of combinatorics, Tome 32 (2025) no. 2. doi: 10.37236/13294

Cité par Sources :