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

9 papers

math.CO2022

A general approach to transversal versions of Dirac-type theorems

Pranshu Gupta, Fabian Hamann, Alp Müyesser +2

Given a collection of hypergraphs $H = (H_{1}, \dots, H_{m})$ with the same vertex set, an $m$ -edge graph $F \subset \cup_{i \in [m]} H_{i}$ is a transversal if there is a bijection $…

math.CO2022

Walker-Breaker Games on $G_{n, p}$

Dennis Clemens, Pranshu Gupta, Yannick Mogge

The Maker-Breaker connectivity game and Hamilton cycle game belong to the best studied games in positional games theory, including results on biased games, games on random graphs a…

math.CO2022

Ramsey equivalence for asymmetric pairs of graphs

Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta +1

A graph $F$ is Ramsey for a pair of graphs $(G, H)$ if any red/blue-coloring of the edges of $F$ yields a copy of $G$ with all edges colored red or a copy of $H$ with all edges colo…

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.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,…

math.CO2020★ 2 cited

Fast Strategies in Waiter-Client Games on $K_{n}$

Dennis Clemens, Pranshu Gupta, Fabian Hamann +3

Waiter-Client games are played on some hypergraph $(X, F)$ , where $F$ denotes the family of winning sets. For some bias $b$ , during each round of such a game Wai…

cs.NE2019

Algorithms Inspired by Nature: A Survey

Pranshu Gupta

Nature is known to be the best optimizer. Natural processes most often than not reach an optimal equilibrium. Scientists have always strived to understand and model such processes.…

A general approach to transversal versions of Dirac-type theorems

Walker-Breaker Games on Gn,p​

Ramsey equivalence for asymmetric pairs of graphs

Ramsey simplicity of random graphs

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

r-cross t-intersecting families via necessary intersection points

Minimal Ramsey graphs with many vertices of small degree

Fast Strategies in Waiter-Client Games on Kn​

Algorithms Inspired by Nature: A Survey

Walker-Breaker Games on $G_{n, p}$

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

Fast Strategies in Waiter-Client Games on $K_{n}$