1 citations · 1 across the 1 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2024
The bunkbed conjecture is false
Nikita Gladkov, Igor Pak, Aleksandr Zimin
We give an explicit counterexample to the Bunkbed Conjecture introduced by Kasteleyn in 1985. The counterexample is given by a planar graph on vertices, and is built on the…
math.CO2024
Exploring mazes at random
Nikita Gladkov, Igor Pak
We consider a probabilistic version of the depth-first search on mazes with two exits, and show that this algorithm has equal probability of finding either exit. The proof is combi…