Damian Reding

activity

20172019

most citedOn the size-Ramsey number of grid graphs

5 citations · 9 across the 5 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017

Ramsey equivalence of $K_{n}$ and $K_{n} + K_{n - 1}$ for multiple colours

Damian Reding

In 2015 Bloom and Liebenau proved that $K_{n}$ and $K_{n} + K_{n - 1}$ possess the same $2$ -Ramsey graphs for all $n \geq 3$ (with a single exception for $n = 3$ ). In the following we give a…

math.CO2017

A natural generalisation in graph Ramsey theory

Alexander Haupt, Damian Reding

In this note we study graphs $G_{r}$ with the property that every colouring of $E (G_{r})$ with $r + 1$ colours admits a copy of some graph $H$ using at most $r$ colours. For $1\le r\le e…

math.CO2017

The size-Ramsey number of powers of paths

Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa +4

Given graphs $G$ and $H$ and a positive integer $q$ say that $G$ is $q$ -Ramsey for $H$ , denoted $G \to (H)_{q}$ , if every $q$ -colouring of the edges of $G$ contains a monochro…

Ramsey equivalence of Kn​ and Kn​+Kn−1​ for multiple colours

A natural generalisation in graph Ramsey theory

The size-Ramsey number of powers of paths

Ramsey equivalence of $K_{n}$ and $K_{n} + K_{n - 1}$ for multiple colours