P
Initializing...
Theorem 7.1 — every graph with m edges has a (6 log_{4/3} 2m)⁻¹-decomposition with |∂(A₁, …, A_k)| ≤ |E|/2 · Prove2Me