Free random-cluster boundary condition
= Free random-cluster boundary condition
{title2=$\xi=\{\{v\}:v\in\partial\Lambda\}$}
The boundary partition has singleton blocks, so no different boundary <graph vertices>[vertices] are identified. Open component counting is the ordinary counting in the finite <graph>, including isolated <graph vertices>[vertices]. This is the least wired <random-cluster boundary condition>.