Bipartite graphs and combinatorial adjacency
classification
🧮 math.GT
keywords
adjacencybipartitecombinatoriallinksgraphstorusapplicationbraids
read the original abstract
We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links. We then introduce a combinatorial notion of adjacency for bipartite graph links and discuss its potential relation with the adjacency problem for plane curve singularities.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.