5 citations · 9 across the 5 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018★ 4 cited
On minimal Ramsey graphs and Ramsey equivalence in multiple colours
Dennis Clemens, Anita Liebenau, Damian Reding
For an integer , a graph is called -Ramsey for a graph if every -colouring of the edges of contains a monochromatic copy of . If is -Ramsey for…
math.CO2018
Minimal Ramsey graphs for cyclicity
Damian Reding, Anusch Taraz
We study graphs with the property that every edge-colouring admits a monochromatic cycle (the length of which may depend freely on the colouring) and describe those graphs that are…