Menger's n-Arc Theorem
Let 
be a graph with 
and 
two disjoint 
-tuples of Vertices. Then either contains pairwise disjoint 
-paths, each connecting a point of and a point of , or there exists a set of fewer than Vertices that separate and .
References
Menger, K. Kurventheorie. Leipzig, Germany: Teubner, 1932.
- Napoleon's Problem
- Napoleon's Theorem
- Napoleon Triangles
- Nappe
- Narcissistic Number
- Nash Equilibrium
- Nash's Theorem
- Nasik Square
- Nasty Knot
- Natural Density
- Natural Equation
- Natural Independence Phenomenon
- Natural Invariant
- Natural Logarithm
- Natural Measure
- Natural Norm
- Natural Number
- Naught
- Navigation Problem
- N-Cluster
- n-Cube
- Nearest Integer Function
- Nearest Neighbor Problem
- Near-Integer
- Near Noble Number