Abstract
We study multicolor ordered Ramsey numbers, an analog of the classical Ramsey numbers for an arbitrary number of colors and graphs with linearly ordered vertex sets. We generalize upper and lower bounds on two-colored ordered Ramsey numbers of ordered matchings by Conlon, Fox, Lee, and Sudakov to an arbitrary number of colors. Using the extremal theory of matrices, we prove that the q -color ordered Ramsey numbers of ordered matchings on n vertices with interval chromatic number two are in nΘ(q), which is tight up to a constant in the exponent. We extend this result to ordered graphs with bounded degeneracy and with interval chromatic number two.
| Original language | English |
|---|---|
| Article number | 115286 |
| Journal | Discrete Mathematics |
| Volume | 349 |
| Issue number | 11 |
| DOIs | |
| State | Published - 1 Nov 2026 |
| Externally published | Yes |
Keywords
- Ordered Rumsey number
- Ordered graph
- Ramsey number
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'Estimating multicolor ordered Ramsey numbers'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver