A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We consider, for every positive integer $a$, probability distributions on subsets of vertices of a graph with the property that every vertex belongs to the random set sampled from this distribution with probability at most $1/a$. Among other results, we prove that for every positive integer $a$ and every planar graph $G$, there exists such a probability distribution with the additional property that for any set $X$ in the support of the distribution, the graph $G-X$ has component-size at mostdoi:10.37236/8909 fatcat:cmcffslxnndfdene7px3ktey5i