We prove that two disjoint graphs must always be drawn separately on the Klein bottle, in order to minimize the crossing number of the whole drawing.
生成讲解博客的中文版本
生成AI智能校验的中文版本