{
  "abstract": "For an integer $h\\geq2$, an edge-ordered $h$-uniform hypergraph $H^<$ is an $h$-uniform hypergraph with a linear ordering of its hyperedges. For an integer $q \\geq 1$, the edge-ordered Ramsey number $R_{\\mathrm{edge}}(H^<;q)$ of $H^<$ is the smallest positive integer $N$ such that there exists an edge-ordered $h$-uniform hypergraph $G^<$ on $N$ vertices such that, for every $q$-coloring of the hyperedges of $G^<$, there is a monochromatic copy of $H^<$ in $G^<$ preserving the hyperedge order. In this note, we show that, for every edge-ordered $h$-uniform hypergraph $F^<$ on $n$ vertices with $m\\geq1$ hyperedges, $R_{\\mathrm{edge}}(F^<;q) \\leq R_h(F;q)^{Cm^2}$ where $F$ is the underlying unordered hypergraph, $R_h(F;q)$ is its standard $q$-color Ramsey number, and $C=C(h,q)>0$ is a constant. For fixed $h\\geq3$ and $q\\geq2$, this shows that prescribing the hyperedge order does not require an increase in the tower height of the classical upper bound. It also settles a problem posed by Fox and Li (2020), and for $h=2$ gives the bound $2^{O(n^4\\log n)}$, improving their bounds for every fixed $q \\geq 3$.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.39653",
  "author_total": 2,
  "authors": [
    {
      "name": "Martin Balko"
    },
    {
      "name": "Jelena Glišić"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/66cv585f8z64q.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.39653",
  "fulltext_url": null,
  "id": "66cv585f8z64q",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.39653",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.DM"
    ],
    [
      "arxiv",
      "math.CO"
    ]
  ],
  "openalex": null,
  "pdf_url": "https://arxiv.org/pdf/2610.39653",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-29",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/66cv585f8z64q.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:36:32Z",
      "native_id": "2610.39653",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.39653"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "On edge-ordered Ramsey numbers of hypergraphs",
  "title_text": "On edge-ordered Ramsey numbers of hypergraphs",
  "type": "preprint",
  "updated_at": "2026-11-01T12:20:50Z",
  "url": "https://research.draconitic.com/paper/66cv585f8z64q",
  "venue": "arXiv",
  "versions": []
}