P
Initializing...
Theorem 4.2 — every graph with boolean-width k has twin-width at most 2^{k+1} − 1 · Prove2Me