A Ramsey-Type Theorem for Orderings of a Graph

It is shown that for any graph G on n vertices, there is a number N (of order at most $n^3 (\log n)^2 $) and a graph H on N vertices such that for any ordering of the vertices of G and any ordering of the vertices of H, there is an order-isomorphism from G into H.