{
  "abstract": "We prove the following two upper bounds for ordered Ramsey numbers: (1) Every ordered forest $F$ on $n$ vertices satisfies $R_{<}(F,F)=O(n^{1+\\lceil\\logχ_{<}(F)\\rceil})$. This in particular answers a question of Geneson, Holmes, Liu, Neidinger, Pehova and Wass. (2) There is a function $f$ such that, for every fixed ordered graph $H$ with maximum degree at most $Δ$ and interval chromatic number at most $k$, it holds that $R_{<}(H,K_n)=O_H(n^{f(Δ,k)})$.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.38828",
  "author_total": 2,
  "authors": [
    {
      "name": "Lior Gishboliner"
    },
    {
      "name": "Xiangyu Li"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/7eyfc3309nxye.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.38828",
  "fulltext_url": null,
  "id": "7eyfc3309nxye",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.38828",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.CO"
    ],
    [
      "openalex",
      "2607|Limits and Structures in Graph Theory"
    ]
  ],
  "openalex": "W7215061599",
  "pdf_url": "https://arxiv.org/pdf/2609.38828",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-30",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/7eyfc3309nxye.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:25:49Z",
      "native_id": "2609.38828",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.38828"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Upper bounds for ordered Ramsey numbers of forests and bounded-degree graphs",
  "title_text": "Upper bounds for ordered Ramsey numbers of forests and bounded-degree graphs",
  "type": "preprint",
  "updated_at": "2026-10-30T12:25:49Z",
  "url": "https://research.draconitic.com/paper/7eyfc3309nxye",
  "venue": "arXiv",
  "versions": []
}