# Category:Theorems in discrete geometry

Computing portal |

Here is a list of articles in the category **Theorems in discrete geometry** of the Computing portal that unifies foundations of mathematics and computations using computers.

## Pages in category "Theorems in discrete geometry"

The following 20 pages are in this category, out of 20 total.

### A

- Alexandrov's uniqueness theorem
*(computing)*

### B

- Balinski's theorem
*(computing)* - Beck's theorem (geometry)
*(computing)*

### C

- Carathéodory's theorem (convex hull)
*(computing)* - Cauchy's theorem (geometry)
*(computing)*

### D

- De Bruijn's theorem
*(computing)* - De Bruijn–Erdős theorem (incidence geometry)
*(computing)*

### E

- Erdős–Anning theorem
*(computing)* - Erdős–Nagy theorem
*(computing)* - Erdős–Szekeres theorem
*(computing)*

### F

- Four-vertex theorem
*(computing)*

### H

- Helly's theorem
*(computing)*

### K

- Krein–Milman theorem
*(computing)*

### M

- Monsky's theorem
*(computing)*

### R

- Radon's theorem
*(computing)*

### S

- Steinitz's theorem
*(computing)* - Sylvester–Gallai theorem
*(computing)* - Szemerédi–Trotter theorem
*(computing)*

### T

- Tverberg's theorem
*(computing)*

### W

- Wallace–Bolyai–Gerwien theorem
*(computing)*