This paper proves that every $2$-connected regular matroid of sufficiently large rank has a $2$-connected graphic flat of large rank. Furthermore, we explicitly determine a list of such unavoidable flats.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。