Simple Graphs of Order 12 and Minimum Degree 6 Contain K_6 Minors
Ryan Odeneal, Andrei Pavelescu
·
2019-10-26
·
via math.CO updates on arXiv.org
We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。