4 citations · 4 across the 4 of their papers we have counts for
5 papers
An update on multicolor Ramsey lower bounds
Marcelo Campos, Cosmin Pohoata
Building upon previous works by Conlon-Ferber and Wigderson, Sawin showed a few years ago that upper bounds on the minimum density of independent sets in a -free can be us…
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…
A new lower bound for the Ramsey numbers
Marcelo Campos, Matthew Jenssen, Marcus Michelen +1
We prove a new lower bound for the off-diagonal Ramsey numbers, \[ R(3,k) \geq \bigg( \frac{1}{3}+ o(1) \bigg) \frac{k^2}{\log k }\, , \] thereby narrowing the gap between the uppe…
Towards an optimal hypergraph container lemma
Marcelo Campos, Wojciech Samotij
The hypergraph container lemma is a powerful tool in probabilistic combinatorics that has found many applications since it was first proved a decade ago. Roughly speaking, it asser…
A new lower bound for sphere packing
Marcelo Campos, Matthew Jenssen, Marcus Michelen +1
We show there exists a packing of identical spheres in with density at least \[ (1-o(1))\frac{d \log d}{2^{d+1}}\, , \] as . This improves upon previous…