Bisected vertex leveling of plane graphs: braid index, arc index and delta diagrams
Sungjong No, Seungsang Oh, Hyungkee Yoo

TL;DR
This paper introduces a new planar embedding technique called bisected vertex leveling for plane graphs, providing elementary proofs for bounds on braid and arc indices of knots and links, and establishing a quadratic bound for delta diagrams.
Contribution
It presents a novel bisected vertex leveling method and uses it to give simplified proofs of known bounds and new bounds on delta diagrams for knots and links.
Findings
Elementary proofs of bounds on braid and arc indices.
Quadratic upper bound for crossing number of delta diagrams.
Introduction of bisected vertex leveling technique.
Abstract
In this paper, we introduce a bisected vertex leveling of a plane graph. Using this planar embedding, we present elementary proofs of the well-known upper bounds in terms of the minimal crossing number on braid index and arc index for any knot or non-split link , which are and . We also find a quadratic upper bound of the minimal crossing number of delta diagrams of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Advanced Graph Theory Research · Computational Geometry and Mesh Generation
