---
res:
  bibo_abstract:
  - "Given a vertex-ordered graph G, the ordered Ramsey number\r\nr<(G) is the minimum
    integer N such that every 2-coloring of the edges of\r\nthe complete ordered graph
    KN contains a monochromatic ordered copy of G.\r\nMotivated by a similar question
    posed by Erd˝os and Graham [On partition\r\ntheorems for finite graphs, Infinite
    and finite sets (Colloq., Keszthely, 1973),\r\nNorth-Holland, Amsterdam-London,
    pp. 515–527] in the unordered setting,\r\nwe study the problem of bounding the
    ordered Ramsey number of any ordered graph G with m edges and no isolated vertices.
    We prove that r<(G) ≤\r\ne109√m(log log m)3/2\r\nfor any such G, which is tight
    up to the (log log m)3/2\r\nfactor in the exponent. As a corollary, we obtain
    the corresponding bound for\r\nthe oriented Ramsey number of a directed graph
    with m edges.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Domagoj
      foaf_name: Bradač, Domagoj
      foaf_surname: Bradač
  - foaf_Person:
      foaf_givenName: Patryk
      foaf_name: Morawski, Patryk
      foaf_surname: Morawski
  - foaf_Person:
      foaf_givenName: Benny
      foaf_name: Sudakov, Benny
      foaf_surname: Sudakov
  - foaf_Person:
      foaf_givenName: Yuval
      foaf_name: Wigderson, Yuval
      foaf_surname: Wigderson
      foaf_workInfoHomepage: http://www.librecat.org/personId=2d0023a0-1567-11f0-833d-d5c1e476d4b5
  bibo_doi: 10.1090/proc/17442
  bibo_issue: '3'
  bibo_volume: 154
  dct_date: 2026^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0002-9939
  - http://id.crossref.org/issn/1088-6826
  dct_language: eng
  dct_publisher: American Mathematical Society@
  dct_title: "Ordered Ramsey numbers of graphs with \U0001D45A edges@"
...