The (t−1) $(t-1)$‐chromatic Ramsey number for paths
Authors:
Open Access
- 19 October 2022
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 102 (4) , 784-796
Abstract
The following relaxation of the classical problem of determining the Ramsey number of a fixed graph has first been proposed by Erdős, Hajnal and Rado over 50 years ago. Given a graph and an integer determine the minimum number such that in any ‐coloured complete graph on vertices there is a copy of using only edges of some colours. We determine the answer precisely when is a path.Keywords
This publication has 25 references indexed in Scilit:
- A generalization of Ramsey theory for linear forestsInternational Journal of Computer Mathematics, 2012
- Three-Color Ramsey Numbers For PathsCombinatorica, 2007
- New Lower Bounds on the Multicolor Ramsey Numbers Rr(C2m)Graphs and Combinatorics, 2006
- A Ramsey‐type problem and the Turán numbers*Journal of Graph Theory, 2002
- Weakened Ramsey numbersDiscrete Applied Mathematics, 1999
- R(Cn,Cn,Cn)⩽(4+o(1))nJournal of Combinatorial Theory, Series B, 1999
- On a generalization of Ramsey theoryDiscrete Mathematics, 1982
- A generalization of Ramsey theory for graphsDiscrete Mathematics, 1978
- On a Ramsey type theoremPeriodica Mathematica Hungarica, 1972
- Partition relations for cardinal numbersActa Mathematica Hungarica, 1965