Linear-threshold conjecture for connected size Ramsey numbers of star matchings

From papers

Let nK1,pnK_{1,p} be the disjoint union of nn copies of the star K1,pK_{1,p}, and let K1,mK_{1,m} be the star with mm edges. The connected size Ramsey number r^c(G1,G2)\hat r_c(G_1,G_2) is the minimum number of edges in a connected graph GG such that G(G1,G2)G\to (G_1,G_2). Linear-threshold conjecture. There exists a positive constant cc such that for all positive integers mm, nn, and pp with mc(n+p)m\geq c(n+p), we have

r^c(nK1,p,K1,m)=n(m+p)1.\hat r_c(nK_{1,p},K_{1,m})=n(m+p)-1.

The conjecture proposes that the exact value established in the paper for the stronger condition m(n2+2pn+n3)/2m\geq (n^2+2pn+n-3)/2 remains valid once mm is merely linear in n+pn+p.

Progress summary

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

Sources & referencesView supporting material

Primary source

Fanghua Guo, Yanbo Zhang and Yunqing Zhang, “Matching-star size Ramsey numbers under connectivity constraint”, arXiv:2404.03175 (2024).

Solutions 0

No solutions have been posted yet.