Wen Chen

New bounds on the size-Ramsey numbers of hypergraphs

We obtain two new bounds for the size-Ramsey numbers of k -uniform hypergraphs. First, we prove that R ˆ ( K n ( k ) ) ≥ R ˆ ( K n − 2 ( k − 2 ) ) ( k 2 ) ( R ( K n ( k ) ) 2 ) for k ≥ 4 and n ≥ k , which extends a result of Dudek, La Fleur, Mubayi and Rödl (2017). Second, extend...