New lower bounds on the size-Ramsey number of a path (Q2073313)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7467811
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New lower bounds on the size-Ramsey number of a path |
scientific article; zbMATH DE number 7467811 |
Statements
New lower bounds on the size-Ramsey number of a path (English)
0 references
1 February 2022
0 references
Summary: 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.
0 references
2-coloring
0 references
size-Ramsey number
0 references
0.8555195927619934
0 references
0.8326969742774963
0 references
0.8298742175102234
0 references
0.8260297775268555
0 references
