Counterexamples to the site-percolation analogues of the Easo-Severo-Tassion cutset theorems
Easo, Severo and Tassion [EST25] proved two theorems about minimal edge cutsets in infinite graphs: that non-triviality of the uniform critical percolation parameter is equivalent to exponential growth of the number of minimal edge cutsets of size n separating a vertex from infinity, and that uniform transience is an alternative sufficient assumption. We show that the naive extensions of (the original contribution to) these theorems to site percolation and vertex cutsets are false; our counterexample involves modifying a rooted binary tree and replacing edges with gadgets that allow many choices for where to block (in constructing a cutset) one of two local routes, while keeping every vertex uniformly close to a supercritical, uniformly transient shortcut skeleton.