加载中…
A graph is said to be -ubiquitous, where is the minor relation between graphs, if whenever is a graph with $nG \preceq \Gamman \in \aleph_0 G \preceq \Gamma\alpha G\alphaG$. A well-known conjecture of Andreae is that every locally finite connected graph is -ubiquitous. In this paper we give a sufficient condition on the structure of the ends of a graph~ which implies that is -ubiquitous. In particular this implies that the full grid is -ubiquitous.

生成讲解博客的中文版本

生成AI智能校验的中文版本