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}
}
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
92 Citations
On some three color Ramsey numbers for paths and cycles
  • 5
  • Highly Influenced
  • PDF
The (t-1)-chromatic Ramsey number for paths
  • Highly Influenced
  • PDF
On some three-color Ramsey numbers for paths
  • Highly Influenced
  • PDF
Turán's problem and Ramsey numbers for trees
  • 2
  • PDF
Ramsey numbers in octahedron graphs
  • 2
On Some Exact Values of Three-Color Ramsey Numbers for Paths
  • Highly Influenced
Finding a monochromatic subgraph or a rainbow path
  • 4
A note on (t - 1)-chromatic Ramsey number of linear forests
  • A. Khamseh
  • Mathematics, Computer Science
  • Int. J. Comput. Math. Comput. Syst. Theory
  • 2020
  • 1
  • Highly Influenced
Finding a monochromatic subgraph or a rainbow path
  • 6
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-6 OF 6 REFERENCES
On a Problem of Formal Logic
  • 1,877
Graph theory
  • 13,776
  • PDF
On maximal paths and circuits of graphs
  • 439