7 citations · 8 across the 8 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
Biased partitions of
Peter van Hintum
Given a function on the vertex set of some graph , a scenery, let a simple random walk run over the graph and produce a sequence of values. Is it possible to, with high prob…
math.CO2018★ 7 cited
The bunkbed conjecture on the complete graph
Peter van Hintum, Piet Lammers
The bunkbed conjecture was first posed by Kasteleyn. If is a finite graph and some subset of , then the bunkbed of the pair is the graph p…