arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.07247math.COmath.GN
收藏

可数确定端与图

Countably determined ends and graphs

Jan Kurkofka, Ruben Melcher

摘要:

无限图$G$的方向是其端点的缠结描述:它们是选择函数,为所有有限顶点集$X\subseteq V(G)$相容地选择$G-X$的一个分量。虽然每个方向都是由一条射线诱导的,但存在一些图的方向不是由其选择的任何可数子集唯一确定的。我们将这些方向和它们的可数确定的对应物在星形子结构或射线的图形。奇怪的是,存在这样一些图,它们的方向都是可数确定的,但不能同时用可数多个选择来区分。我们在结构上的图形,其方向可以区分所有一次由可数许多选择,我们在结构上的图形,承认没有这样的可数许多选择。我们的特点是措辞在正常的树和树分解。我们的四个(子)结构特征意味着四类无限图的组合特征,这些无限图是由应用于其端空间的第一和第二可数公理定义的:两类图的端空间分别是第一可数或第二可数的,以及这两类图的补图。

英文摘要:

The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a ray, there exist directions of graphs that are not uniquely determined by any countable subset of their choices. We characterise these directions and their countably determined counterparts in terms of star-like substructures or rays of the graph. Curiously, there exist graphs whose directions are all countably determined but which cannot be distinguished all at once by countably many choices. We structurally characterise the graphs whose directions can be distinguished all at once by countably many choices, and we structurally characterise the graphs which admit no such countably many choices. Our characterisations are phrased in terms of normal trees and tree-decompositions. Our four (sub)structural characterisations imply combinatorial characterisations of the four classes of infinite graphs that are defined by the first and second axiom of countability applied to their end spaces: the two classes of graphs whose end spaces are first countable or second countable, respectively, and the complements of these two classes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑