The Ramsey size number of dipaths

  • Authors:

  • David Reimer

  • Affiliations:

  • Department of Mathematics and Statistics, The College of New Jersey, P.O. Box 7718, Ewing, NJ

  • Venue:
  • Discrete Mathematics
  • Year:
  • 2002

Quantified Score

Hi-index 0.05

Visualization

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.