Properties of minimal charts and their applications V: Charts of type (3,2,2)
Teruo Nagase, Akiko Shima · Journal of Knot Theory and Its Ramifications · 2019
Let [Formula: see text] be a chart, and we denote by [Formula: see text] the union of all the edges of label [Formula: see text]. A chart [Formula: see text] is of type [Formula: see text] if there exists a label [Formula: see text] such that [Formula: see text], [Formula: see text], [Formula: see text], and [Formula: see text] where [Formula: see text] is the number of white vertices in [Formula: see text]. In this paper, we prove that there is no minimal chart of type [Formula: see text].