MathDB
Problems
Contests
Undergraduate contests
Putnam
1966 Putnam
B5
B5
Part of
1966 Putnam
Problems
(1)
Putnam 1966 B5
Source:
4/6/2022
Given
n
(
≥
3
)
n(\geq 3)
n
(
≥
3
)
distinct points in the plane, no three of which are on the same straight line, prove that there exists a simple closed polygon with these points as vertices.
Putnam
graph theory
shortest path