115 citations · 203 across the 24 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021
Path decompositions of random directed graphs
Alberto Espuny Díaz, Viresh Patel, Fabian Stroh
We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decompo…
math.CO2021
Improved bounds for zeros of the chromatic polynomial on bounded degree graphs
Maurizio Moreschi, Viresh Patel, Guus Regts +1
We prove that for any graph of maximum degree at most , the zeros of its chromatic polynomial (in ) lie outside the disk of radius centered at…
math.CO2021★ 8 cited
Sampling from the low temperature Potts model through a Markov chain on flows
Jeroen Huijben, Viresh Patel, Guus Regts
In this paper we consider the algorithmic problem of sampling from the Potts model and computing its partition function at low temperatures. Instead of directly working with spin c…