Lemma 8 — for any rank $i$, the number of vertices of rank $i$ is at most $n/2^i$ · Prove2Me

P

Initializing...

Lemma 8 — for any rank $i$, the number of vertices of rank $i$ is at most $n/2^i$ · Prove2Me