... coincides with (C(L2 ), ) Example Ordered graphs counted by edges Let O be the set of simple graphs with the vertex set [n] and without isolated vertices, and let be the ordered subgraph relation (as ... restrictions on growth of hereditary properties of ordered graphs proved by Balogh, Bollob´s and Morris [6], the polynomial a the electronic journal of combinatorics 15 (2008), #R75 19 growth and the ... Murphy and N Ruˇkuc, Partially well -ordered closed s sets of permutations, Order, 19 (2002), 101–113 ´ [3] J Balogh, B Bollobas and D Weinreich, The speed of hereditary properties of graphs, ...