Notes for AKT-170117-2/0:13:00

Roland At 13:18 there is the statement that the width of a knot diagram is $\mathcal{O}(\sqrt{n})$ where n is the number of crossings. I think this is a consequence of the more general planar-graph result called the Planar Separator Theorem: https://en.wikipedia.org/wiki/Planar_separator_theorem