Locally finite graphs with ends: a topological approach
Reinhard Diestel
备注:
Introductory survey. This post-publication update is the result of a thorough revision undertaken when I lectured on this material in 2012. The emphasis was on correcting errors and, occasionally, improving the presentation. I did not attempt to bring the material as such up to the current level of knowledge
This paper is intended as an introductory survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends, assume the role played in finite graphs by paths and cycles.
This approach has made it possible to extend to locally finite graphs many classical theorems of finite graph theory that do not extend verbatim. The shift of paradigm it proposes is thus as much an answer to old questions as a source of new ones; many concrete problems of both types are suggested in the paper.
This paper attempts to provide an entry point to this field for readers that have not followed the literature that has emerged in the last 10 years or so. It takes them on a quick route through what appear to be the most important lasting results, introduces them to key proof techniques, identifies the most promising open problems, and offers pointers to the literature for more detail.
A family of $ω_1$ many topological types of locally finite trees
两棵有根局部有限树被认为是等价的,如果它们都可以通过树-保序映射作为拓扑子式嵌入到彼此中。Matthiesen利用Nash-William定理对等价类的不可数性给出了一个非构造性的证明,从而回答了van der Holst的一个问题。作为一个开放的问题,Matthiesen要求建设性地证明这一事实。本文的目的是提供一个这样的建设;工作仅在ZFC,我们说明了一个集合!1有根树的许多拓扑型。特别是,我们还表明,这种结构加强了Matthiesen,因为它也适用于自由(无根)树的程度2。