P

Initializing...

A plane graph with $n\ge3$ vertices has at most $3n-6$ edges (Diestel, Corollary 4.2.10) · Prove2Me