2 papers
cs.DS2026
Sampling Tree-Weighted Partitions Without Sampling Trees
Sarah Cannon, Topher Pankow, Wesley Pegden +1
This paper gives a new algorithm for sampling tree-weighted partitions of a large class of planar graphs. Formally, the tree-weighted distribution on -partitions of a graph weig…
math.CO2025
Competitively Constructed Planar Graphs
Wesley Pegden, Eric Wang
We introduce and study two Maker-Breaker-like games for constructing planar graphs: the edge drawing game, where two players take turns drawing non-intersecting edges between point…