P

Initializing...

Theorem 2 (Erdős–Gallai), p. 2 — a graph with no cycle longer than k has at most k(n−1)/2 edges (corrected) · Prove2Me