Title of article
The Ramsey size number of dipaths
Author/Authors
David Reimer، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
3
From page
173
To page
175
Abstract
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.
Keywords
Ramsey size number , Dipath , Graph theory
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
949333
Link To Document