Davoodi–Javadi–Kamranian–Raeisi multicolor star-forest conjecture

Let tt be an integer, let a1,a2,,ata_{1},a_{2},\dots,a_{t} be positive integers, and set

a=s=1tas.a=\sum_{s=1}^{t}a_{s}.

For each s[t]s\in[t], let n1sn2snass1n_{1}^{s}\geq n_{2}^{s}\geq\cdots\geq n_{a_{s}}^{s}\geq1 be integers. For each k[a]\[t1]k\in[a]\backslash[t-1], define

k=max{s=1tnisst+1:s=1tis=k}.\ell_{k}=\max\left\{\sum_{s=1}^{t}n_{i_{s}}^{s}-t+1:\sum_{s=1}^{t}i_{s}=k\right\}.

Davoodi–Javadi–Kamranian–Raeisi conjecture. The multicolor size Ramsey number satisfies

r^(i=1a1K1,ni1,i=1a2K1,ni2,,i=1atK1,nit)=k=tak.\hat{r}\left(\bigsqcup_{i=1}^{a_{1}}K_{1,n_{i}^{1}},\bigsqcup_{i=1}^{a_{2}}K_{1,n_{i}^{2}},\dots,\bigsqcup_{i=1}^{a_{t}}K_{1,n_{i}^{t}}\right)=\sum_{k=t}^{a}\ell_{k}.

This extends the two-color star-forest conjecture to multiple colors and is presented as a conjectural generalization; no resolution is given in the supplied text.

Sources & referencesView supporting material

Primary source

Pingting Fu, Zhidan Luo and Zhenyu Ni, “Size Ramsey minimal graphs for uniform star forests”, arXiv:2606.04439 (2026).

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.