Multicolor Ramsey conjecture for disjoint unions of three-vertex paths

Let P3P_3 be the path on three vertices, and let grk(K3:n1P3,,nkP3)gr_k(K_3:n_1P_3,\ldots,n_kP_3) denote the corresponding Gallai-Ramsey number. For positive integers k,n1,n2,,nkk,n_1,n_2,\ldots,n_k with n1=max{ni}n_1=\max\{n_i\}, the multicolor P3P_3 Ramsey conjecture.

R(n1P3,n2P3,,nkP3)=grk(K3:n1P3,n2P3,,nkP3)=2n1+1+i=1k(ni1).R(n_1P_3,n_2P_3,\ldots,n_kP_3)=gr_k(K_3:n_1P_3,n_2P_3,\ldots,n_kP_3)=2n_1+1+\sum_{i=1}^k(n_i-1).

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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.