Linear-threshold conjecture for connected size Ramsey numbers of star matchings
Linear-threshold conjecture for connected size Ramsey numbers of star matchings
Let be the disjoint union of copies of the star , and let be the star with edges. The connected size Ramsey number is the minimum number of edges in a connected graph such that . Linear-threshold conjecture. There exists a positive constant such that for all positive integers , , and with , we have
The conjecture proposes that the exact value established in the paper for the stronger condition remains valid once is merely linear in .
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
Sign in to submit a solution.
No solutions have been posted yet.