Dennis Clemens

activity

20122026

most citedCreating cycles in Walker-Breaker games

8 citations · 31 across the 24 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021

Ramsey simplicity of random graphs

Simona Boyadzhiyska, Dennis Clemens, Shagnik Das +1

A graph $G$ is $q$ -Ramsey for another graph $H$ if in any $q$ -edge-colouring of $G$ there is a monochromatic copy of $H$ , and the classic Ramsey problem asks for the minimum number…

math.CO2021

On the minimum degree of minimal Ramsey graphs for cliques versus cycles

Anurag Bishnoi, Simona Boyadzhiyska, Dennis Clemens +3

A graph $G$ is said to be $q$ -Ramsey for a $q$ -tuple of graphs $(H_{1}, \dots, H_{q})$ , denoted by $G \to_{q} (H_{1}, \dots, H_{q})$ , if every $q$ -edge-coloring of $G$ contains a monochromatic c…

math.CO2021★ 1 cited

The tree packing conjecture for trees of almost linear maximum degree

Peter Allen, Julia Böttcher, Dennis Clemens +3

We prove that there is $c > 0$ such that for all sufficiently large $n$ , if $T_{1}, \dots, T_{n}$ are any trees such that $T_{i}$ has $i$ vertices and maximum degree at most $c n / lo g n$ , the…