Notes for AKT-170117-2/0:13:00: Difference between revisions
From Drorbn
Jump to navigationJump to search
(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...") |
No edit summary |
||
| Line 1: | Line 1: | ||
{{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 consequence of the more general planar-graph result called the Planar Separator Theorem: |
{{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 consequence of the more general planar-graph result called the Planar Separator Theorem, or rather the edge version: |
||
https://en.wikipedia.org/wiki/Planar_separator_theorem |
https://en.wikipedia.org/wiki/Planar_separator_theorem |
||
Here's a link to the relevant article: |
|||
http://www.sciencedirect.com/science/article/pii/S0196677483710138?via%3Dihub |
|||
Revision as of 17:48, 17 January 2017
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, or rather the edge version: https://en.wikipedia.org/wiki/Planar_separator_theorem Here's a link to the relevant article: http://www.sciencedirect.com/science/article/pii/S0196677483710138?via%3Dihub
