Properties of minimal charts and their applications VII: charts of type (2,3,2)

Abstract

Let be a chart, and we denote by m the union of all the edges of label m. A chart is of type (2,3,2) if there exists a label m such that w()=7, w(mm+1)=2, w(m+1m+2)=3, and w(m+2m+3)=2 where w(G) is the number of white vertices in G. In this paper, we prove that there is no minimal chart of type (2,3,2).

0

Discussion (0)

Sign in to join the discussion.

Loading comments…