论文标题
完整的未分离平面图补充的未成年人
Complete Minors in Complements of Non-Separating Planar Graphs
论文作者
论文摘要
我们证明，订单$ 2n-3 $的任何非分离平面图的补充都包含$ k_n $ binor，并认为该属性的订单$ 2N-3 $是最低的。为了说明非分离假设的必要性，我们举了一个平面图11的示例，其补充不包含$ k_7 $ binor。我们认为，订单11的平面图的补充是本质上打结的。我们计算了Hadwiger数量的轮子图。
We prove that the complement of any non-separating planar graph of order $2n-3$ contains a $K_n$ minor, and argue that the order $2n-3$ is lowest possible with this property. To illustrate the necessity of the non-separating hypothesis, we give an example of a planar graph of order 11 whose complement does not contain a $K_7$ minor. We argue that the complements of planar graphs of order 11 are intrinsically knotted. We compute the Hadwiger numbers of complements of wheel graphs.
