The structure of a minimal $n$-chart with two crossings I: Complementary domains of $Γ_1\cupΓ_{n-1}$
英文摘要：
This is the first step of the two steps to enumerate the minimal charts with two crossings. For a label $m$ of a chart $Γ$ we denote by $Γ_m$ the union of all the edges of label $m$ and their vertices. For a minimal chart $Γ$ with exactly two crossings, we can show that the two crossings are contained in $Γ_α\capΓ_β$ for some labels $α<β$. In this paper, we study the structure of a disk $D$ not containing any crossing but satisfying $Γ\cap \partial D\subsetΓ_{α+1}\cup Γ_{β-1}$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
