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 2020Show all

3 papers · 1 filter

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…

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​

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

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