# Ramsey Numbers of Ordered Graphs

@article{Balko2020RamseyNO,
title={Ramsey Numbers of Ordered Graphs},
author={Martin Balko and Josef Cibulka and Karel Kr'al and Jan Kyn{\vc}l},
journal={Electronic Journal of Combinatorics},
year={2020},
volume={27}
}
• M. Balko, +1 author J. Kynčl
• Published 2020
• Mathematics
• Electronic Journal of Combinatorics
An ordered graph is a pair $\mathcal{G}=(G,\prec)$ where $G$ is a graph and $\prec$ is a total ordering of its vertices. The ordered Ramsey number $\overline{R}(\mathcal{G})$ is the minimum number $N$ such that every ordered complete graph with $N$ vertices and with edges colored by two colors contains a monochromatic copy of $\mathcal{G}$. In contrast with the case of unordered graphs, we show that there are arbitrarily large ordered matchings $\mathcal{M}_n$ on $n$ vertices for which… Expand
Edge-ordered Ramsey numbers
• Computer Science, Mathematics
• Eur. J. Comb.
• 2020
A natural class of edge-orderings, called lexicographic edge- orderings, is introduced, for which the authors can prove much better upper bounds on the corresponding edge-ordered Ramsey numbers. Expand
Ramsey numbers of ordered graphs under graph operations
• Mathematics
• 2019
An ordered graph $\mathcal{G}$ is a simple graph together with a total ordering on its vertices. The (2-color) Ramsey number of $\mathcal{G}$ is the smallest integer $N$ such that every 2-coloring ofExpand
Upper Bounds for Ordered Ramsey Numbers of Graphs on Four Vertices
• Mathematics
• 2018
An ordered graph $H$ on $n$ vertices is a graph whose vertices have been labeled bijectively with $\{1,...,n\}$. The ordered Ramsey number $r_<(H)$ is the minimum $n$ such that every two-coloring ofExpand
Off-Diagonal Ordered Ramsey Numbers of Matchings
It is shown that the off-diagonal ordered Ramsey numbers for matchings in which edges do not cross are nearly linear, and a truly sub-quadratic upper bound for random matchings with interval chromatic number 2 is proved. Expand
Biclique Partitions and Off-diagonal Ordered Ramsey Numbers SPUR Final Paper , Summer 2018
We study two separate combinatorial problems. First, we look at the problem of partitioning the edges of the complete graph Kn into the minimum possible number of complete bipartite graphsExpand