Pranshu Gupta

collaborators

2 papers

math.CO2025

A framework for the generalised ErdÅs-Rothschild problem and a resolution of the dichromatic triangle case

Pranshu Gupta, Yani Pehova, Emil Powierski +1

The ErdÅs-Rothschild problem from 1974 asks for the maximum number of $s$ -edge colourings in an $n$ -vertex graph which avoid a monochromatic copy of $K_{k}$ , given positive integers…

math.CO2024

Dirac's theorem for graphs of bounded bandwidth

Alberto Espuny DÃaz, Pranshu Gupta, Domenico Mergoni Cecchelli +2

We provide an optimal sufficient condition, relating minimum degree and bandwidth, for a graph to contain a spanning subdivision of the complete bipartite graph $K_{2, ℓ}$ . This…

A framework for the generalised ErdÅs-Rothschild problem and a resolution of the dichromatic triangle case

Dirac's theorem for graphs of bounded bandwidth

A framework for the generalised ErdÅs-Rothschild problem and a resolution of the dichromatic triangle case