The Ramsey size number of dipaths

Let H be a finite graph. The Ramsey size number of H, r(H,H), is the minimum number of edges required to construct a graph such that when its edges are 2-colored it contains a monochromatic subgraph, H. In this paper we prove that the Ramsey size number of a directed path is quadratic.