n

nicefa.

Foundational Proof

Graph Connectivity

Connectivity is key. If there is a path between every pair, the world is small.

Institutional Reference: Discrete Mathematics

View Full Proof →