arXiv (All)
open access
A General Upper Bound on Multicolor Ordered Ramsey Numbers
We provide a general upper bound on multicolor ordered Ramsey numbers in terms of the interval chromatic number and the degeneracy of an ordered graph. We extend previous results by Conlon, Fox, Lee, and Sudakov (2017) by showing that for every $n$-vertex ordered graph $G^<$ with degeneracy $d\geq2$
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Strong Edge Colouring of Disk Graphs: A 6-Approximation and an Improved Unit-Disk Bound#1119096
- Explicit and logarithmically improved chromatic bounds for $(P_2\cup P_3)$-free graphs#987759
- A Hajnal-Szemerédi Theorem for Skewed Colorings#1012804
- Uniform Sampling of Proper Graph Colorings via Soft Coloring and Partial Rejection Sampling#1117362
- The maximum number of edges in minimal matching covered graphs#1105537
Record · ID 1064619
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive