New lower bounds on the size-Ramsey number of a path

Deepak Bal, Louis Debiasio

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


We prove that for all graphs with at most (3.75 − o(1))n edges there exists a 2-coloring of the edges such that every monochromatic path has order less than n. This was previously known to be true for graphs with at most 2.5n − 7.5 edges. We also improve on the best-known lower bounds in the r-color case.

Original languageEnglish
Article numberP1.18
JournalElectronic Journal of Combinatorics
Issue number1
StatePublished - 2022


Dive into the research topics of 'New lower bounds on the size-Ramsey number of a path'. Together they form a unique fingerprint.

Cite this