On the Ramsey-Goodness of Paths
On the Ramsey-Goodness of Paths
For a graph G, we denote by $$\nu (G)$$ the order of G, by $$\chi (G)$$ the chromatic number of G and by $$\sigma (G)$$ the minimum size of a color class over all proper $$\chi (G)$$ -colorings of G. For two graphs $$G_1$$ and $$G_2$$ , the Ramsey number …