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

From Drorbn
Revision as of 18:15, 17 January 2017 by Rolandvdv (talk | contribs) (Created page with "{{Roland}} At 13:18 there is the statement that the width of a knot diagram is <math>\mathcal{O}(\sqrt{n})</math> where n is the number of crossings. I think this is a consequ...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

Roland At 13:18 there is the statement that the width of a knot diagram is 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