Pranshu Gupta

activity

20192021

collaborators

4 papers

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.CO2020

$r$ -cross $t$ -intersecting families via necessary intersection points

Pranshu Gupta, Yannick Mogge, Simón Piga +1

Given integers $r \geq 2$ and $n, t \geq 1$ we call families $F_{1}, \dots, F_{r} \subseteq P ([n])$ $r$ -cross $t$ -intersecting if for all $F_{i} \in F_{i}$ ,…

math.CO2020

Minimal Ramsey graphs with many vertices of small degree

Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta

Given any graph $H$ , a graph $G$ is said to be $q$ -Ramsey for $H$ if every coloring of the edges of $G$ with $q$ colors yields a monochromatic subgraph isomorphic to $H$ . Further,…

cs.NE2019

Algorithms Inspired by Nature: A Survey