On every infinite connected locally finite simple unweighted graph, the free uniform spanning forest is a factor of independent identically distributed vertex labels under one root-free Borel equivariant rule.
On every infinite connected locally finite simple unweighted graph, the free uniform spanning forest is a factor of independent identically distributed vertex labels under one root-free Borel equivariant rule.
On every infinite connected locally finite simple unweighted graph, the free uniform spanning forest is a factor of independent identically distributed vertex labels under one root-free Borel equivariant rule.
If correct, answers the general free uniform spanning-forest factor question without amenability or transience assumptions.
Is the free uniform spanning forest an IID factor on every locally finite connected graph?
Publication dates and editorial changes.
OpenAI reports an IID factor for the free uniform spanning forest
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
