Document Type
Article
Publication Date
1-1-2022
Journal / Book Title
Electronic Journal of Combinatorics
Abstract
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.
DOI
10.37236/9804
MSU Digital Commons Citation
Bal, Deepak and Debiasio, Louis, "New lower bounds on the size-Ramsey number of a path" (2022). Department of Mathematics Faculty Scholarship and Creative Works. 239.
https://digitalcommons.montclair.edu/mathsci-facpubs/239
Rights
© The authors. Released under the CC BY-ND license (International 4.0).
Published Citation
Bal, D., & DeBiasio, L. (2022). New Lower Bounds on the Size-Ramsey Number of a Path. The Electronic Journal of Combinatorics, 29(1), #P1.18. https://doi.org/10.37236/9804