This paper proves that every 22-connected regular matroid of sufficiently large rank has a 22-connected graphic flat of large rank. Furthermore, we explicitly determine a list of such unavoidable flats.
生成讲解博客的中文版本
生成AI智能校验的中文版本