论文标题
在安德烈的无处不在猜想上
On Andreae's Ubiquity Conjecture
论文作者
论文摘要
图形$ h $无处不在，如果对于每个自然数字$ n $的每个图$ g $，则包含$ n $ vertex-disexhient $ h $ h $ -minors，其中包含无限的许多vertex-disexchoint $ h $ h $ -minors。 Andreae猜想每个本地有限的图都无处不在。我们给出了这个猜想的不连续的反例。如果每个连接的本地有限图都无处不在，则保持打开状态。
A graph $H$ is ubiquitous if for every graph $G$ that for every natural number $n$ contains $n$ vertex-disjoint $H$-minors contains infinitely many vertex-disjoint $H$-minors. Andreae conjectured that every locally finite graph is ubiquitous. We give a disconnected counterexample to this conjecture. It remains open whether every connected locally finite graph is ubiquitous.
