5
votes
Accepted
Is minimum knot crossing number elementary recursive?
The number of graphs on $n$ vertices is
$$2^{\frac{n(n-1)}{2}}.$$
The number of embeddings of a degree 4 planar graph with $n$ vertices is at most $6^n$. (If you know the clockwise order of the ...
- 24.3k
Only top scored, non community-wiki answers of a minimum length are eligible