Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Chromatic number of ordered graphs with forbidden ordered subgraphs   It is well-known that the graphs not containing a given graph H as a subgraph
have bounded chromatic number if and only if H is acyclic. Here we consider
ordered graphs, i.e., graphs with a linear ordering on their vertex set, and
the function f(H) = sup{chi(G) | G in Forb(H)} where Forb(H) denotes the set of
all ordered graphs that do not contain a copy of H. If H contains a cycle, then
as in the case of unordered graphs, f(H) is infinity. However, in contrast to
the unordered graphs, we describe an infinite family of ordered forests H with
infinite f(H). An ordered graph is crossing if there are two edges uv and u'v'
with u < u' < v < v'. For connected crossing ordered graphs H we reduce the
problem of determining whether f(H) is finite to a family of so-called
monotonically alternating trees. For non-crossing H we prove that f(H) is
finite if and only if H is acyclic and does not contain a copy of any of the
five special ordered forests on four or five vertices, which we call bonnets.
For such forests H, we show that f(H) <= 2^|V(H)| and that f(H) <= 2|V(H)|-3 if
H is connected.

16
The categories of this paper are: stat
26
The categories of this paper are: bayes-an
15
The categories of this paper are: nucl-ex
17
The categories of this paper are: q-fin
32
The categories of this paper are: atom-ph
28
The categories of this paper are: alg-geom
36
The categories of this paper are: cmp-lg
19
The categories of this paper are: eess
31
The categories of this paper are: ao-sci
9
The categories of this paper are: nlin
35
The categories of this paper are: mtrl-th
18
The categories of this paper are: econ
29
The categories of this paper are: funct-an
25
The categories of this paper are: patt-sol
4
The categories of this paper are: cond-mat
5
The categories of this paper are: gr-qc