The (t−1)-chromatic Ramsey number for paths

Matija Bucić, Amir Khamseh

Research output: Contribution to journalArticlepeer-review


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 (Formula presented.) and an integer (Formula presented.) determine the minimum number (Formula presented.) such that in any (Formula presented.) -coloured complete graph on (Formula presented.) vertices there is a copy of (Formula presented.) using only edges of some (Formula presented.) colours. We determine the answer precisely when (Formula presented.) is a path.

Original languageEnglish (US)
Pages (from-to)784-796
Number of pages13
JournalJournal of Graph Theory
Issue number4
StatePublished - Apr 2023

All Science Journal Classification (ASJC) codes

  • Geometry and Topology
  • Discrete Mathematics and Combinatorics


  • (t−1)-chromatic Ramsey numbers
  • Ramsey numbers
  • edge colouring


Dive into the research topics of 'The (t−1)-chromatic Ramsey number for paths'. Together they form a unique fingerprint.

Cite this