This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 1

1966 Putnam, B5
Tags: graph theory , shortest path
Given $n(\geq 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.