P

Initializing...

Arithmetic core of the obstruction: for `n ≥ 8` the complete graph has more than `4n - 6` · Prove2Me