加载中…
Halin’s well-known grid theorem states that a graph with a thick end must contain a subdivision of the hexagonal half-grid. We obtain the following strengthening when is vertex-transitive and locally finite. Either is quasi-isometric to a tree (and therefore has no thick end), or it contains a subdivision of the full hexagonal grid.

生成讲解博客的中文版本

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