Paper Info
Title
New lower bounds on the size-Ramsey number of a path
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.
Year
DOI
Venue
2022
10.37236/9804
ELECTRONIC JOURNAL OF COMBINATORICS
DocType
Volume
Issue
Journal
29
1
ISSN
Citations 
PageRank 
1077-8926
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Deepak Bal1357.32
Louis DeBiasio2287.49