Fáry's theorem
Teorema de Fáry
- Date
- 1936 (Wagner) / 1948 (Fáry) / 1951 (Stein) · confidence high
- Place
- Cologne, North Rhine-Westphalia, Germany
- Credited to
- Klaus Wagner, István Fáry and Sherman K. Stein, independently
- Field
- Knowledge & symbols
What was discovered
A graph-theory theorem stating that every simple planar graph can be drawn without crossings using only straight line segments for its edges; proved independently by Klaus Wagner (1936), István Fáry (1948) and Sherman K. Stein (1951).
What it led to
- Fundamental result in graph drawing and computational geometry
- Basis for algorithms producing straight-line planar graph layouts
- Used in VLSI design and graph visualization software