PreprintCC BY 4.0arXiv
Complete Determination of the Gallai--van der Waerden Number GW(r;3,3)
Abstract
This paper completely determines the Gallai--van der Waerden number GW(r;3,3) for all integers r≥ 3: GW(3;3,3)=GW(4;3,3)=9, GW(r;3,3)=r (r≥ 5).
Related
- The 3-Color 2-Chromatic Gallai-Ramsey Number for Complete Graphs
- An improved lower bound for the van der Waerden number w(3,k)
- Strong complete immersions in graphs with independence number two
- The Game Chromatic Number of Complete Multipartite Graphs with Singletons and Large Parts
- The domination number of the 2-token graph of the complete bipartite graph
BibTeX
@misc{si2026complete,
title = {{Complete Determination of the Gallai--van der Waerden Number \(\mathrmGW(r;3,3)\)}},
author = {Yuan Si},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.30711},
eprint = {2610.30711},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.30711},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Complete Determination of the Gallai--van der Waerden Number GW(r;3,3)
AU - Yuan Si
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.30711
UR - https://arxiv.org/abs/2610.30711
AB - This paper completely determines the Gallai--van der Waerden number GW(r;3,3) for all integers r≥ 3: GW(3;3,3)=GW(4;3,3)=9, GW(r;3,3)=r (r≥ 5).
ER -