Showing math.COShow all
2 papers · 1 filter
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 -edge colourings in an -vertex graph which avoid a monochromatic copy of , 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 . This…