Ramsey goodness of $k$-uniform paths, or the lack thereof

Simona Boyadzhiyska, Allan Lo

Given a pair of $k$-uniform hypergraphs $(G,H)$, the Ramsey number of $(G,H)$, denoted by $R(G,H)$, is the smallest integer $n$ such that in every red/blue-colouring of the edges o…