Ordered Ramsey numbers
<p>Given a labeled graph H with vertex set {1, 2, ..., n}, the ordered Ramsey number r<(H) is the minimum N such that every two-coloring of the edges of the complete graph on {1, 2, ..., N} contains a copy of H with vertices appearing in the same order as in H. The ordered Ramsey number...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Published: |
Elsevier
2016
|