Let i 1 ∈ I be the node of T produced by this push transition, and let T 1 be the subtree of T rooted at i 1 .
the vertices of G that are pushed into the cache in the run associated with t 1 cannot contain any neighbor of v. v is not needed in t 1 .