Multicolor Ramsey conjecture for disjoint unions of three-vertex paths
Multicolor Ramsey conjecture for disjoint unions of three-vertex paths
Let be the path on three vertices, and let denote the corresponding Gallai-Ramsey number. For positive integers with , the multicolor Ramsey conjecture.
The claim would determine the general multicolor classical Ramsey number for these linear forests and identify it with the Gallai-Ramsey number; the source says that this classical number is not known in general.
Sources & referencesView supporting material
Primary source
Haibo Wu, Colton Magnant, Pouria Salehi Nowbandegani and Suman Xia, “All partitions have small parts - Gallai-Ramsey numbers of bipartite graphs”, arXiv:1710.10455 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.