Pranshu Gupta

activity

20192022

most citedFast Strategies in Waiter-Client Games on

K_{n}

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

collaborators

Showing 2021Show all

2 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…