2 papers
math.CO2026
A polynomial improvement for the odd cycle-complete Ramsey numbers
Marcelo Campos, Matthew Jenssen, Marcus Michelen +2
We give a polynomial improvement to the cycle-complete Ramsey numbers \[ r(C_{\ell},K_k) \geq k^{1+1/(\ell- 2) + \varepsilon_{\ell} + o(1)}, \] for all fixed odd with $k…
math.CO2026
Improving in just two bites
Zion Hefty, Paul Horn, Dylan King +1
We present a flexible random construction which, for certain graphs , is able to produce -free graphs with edge density strictly larger than that of the -free process, whi…