rooted regular tree
one vertex of degree k and all others of degree k+1
p_c of rooted tree
1/k
neighbours in d-dimensional lattice
||u-v||=1 where ||x||=sqrt(x1^2+…+xd^2)
dual lattice to L2
obtained by shifting the lattice by (1/2, 1/2)
open in G*
if dual edge is closed
e*
shares a common midpoint with e
subgraph induced by W
vertex set W, edge set {edges that both endpoints are in W}
C connected
if subgraph induced by C is connected