Conway's thrackle conjecture
E266111
UNEXPLORED
Conway's thrackle conjecture is an unsolved problem in combinatorial geometry asserting that in any drawing of a graph where every pair of edges meets exactly once, the number of edges cannot exceed the number of vertices.
Referenced by (1)
| Subject (surface form when different) | Predicate |
|---|---|
|
John H. Conway
→
|
hasConcept |