• DOI:10.1016/0095-8956(75)90080-5
Corpus ID: 119765180

Path Ramsey numbers in multicolorings

@article{Faudree1975PathRN,
  title={Path Ramsey numbers in multicolorings},
  author={R. Faudree and R. Schelp},
  journal={Journal of Combinatorial Theory, Series B},
  year={1975},
  volume={19},
  pages={150-160}
}

• R. Faudree, R. Schelp
• Published 1975
• Mathematics
• Journal of Combinatorial Theory, Series B

Abstract In this paper we consider the general Ramsey number problem for paths when the complete graph is colored with k colors. Specifically, given paths P i 1 , P i 2 ,…, P i k with i 1 , i 2 ,…, i k vertices, we determine for certain i j (1 ≤ j ≤ k ) the smallest positive integer n such that a k coloring of the complete graph K n contains, for some l , a P i l in the l th color. For k = 3, given i 2 , i 3 , the problem is solved for all but a finite number of values of i 1 . The procedure… Expand

View via Publisher

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed