We show that for any simple non-oriented graph G with at least thirteen vertices either G or its complement is intrinsically linked.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。