具有可缩性和可缩性的极小图
Minimal graphs for contractible and dismantlable properties
摘要:
图上的可收缩变换的概念是由Ivashchenko引入的,作为研究数字拓扑和计算机图像分析所产生的分子空间的一种手段,最近已被应用于拓扑数据分析。可收缩变换涉及一个可以在图的顶点和边上执行的四个基本移动的列表,并且已经由Chen,Yau和Yeh证明了这些移动保持了底层团复形的简单同伦类型。一个图称为${\mathcal I}$ -可收缩的,如果人们可以通过一系列可收缩变换将它约化为一个孤立的顶点。受可折叠和非回避单纯复形概念的启发,在本文中,我们研究了某些子类的${\mathcal I}$ -可收缩图,其中一个可以崩溃到一个顶点,只使用这些移动的一个子集。我们的主要结果涉及建设的最小的例子图,所得到的类不同。我们还涉及到这些类的图的概念,$k$ -可折叠的图形和$k$ -可折叠的复合物,这也导致了一个最小的反例,从文献中的一个错误的主张Ivashchenko。我们以一些开放性问题结束。
英文摘要:
The notion of a contractible transformation on a graph was introduced by Ivashchenko as a means to study molecular spaces arising from digital topology and computer image analysis, and more recently has been applied to topological data analysis. Contractible transformations involve a list of four elementary moves that can be performed on the vertices and edges of a graph, and it has been shown by Chen, Yau, and Yeh that these moves preserve the simple homotopy type of the underlying clique complex. A graph is said to be ${\mathcal I}$-contractible if one can reduce it to a single isolated vertex via a sequence of contractible transformations. Inspired by the notions of collapsible and non-evasive simplicial complexes, in this paper we study certain subclasses of ${\mathcal I}$-contractible graphs where one can collapse to a vertex using only a subset of these moves. Our main results involve constructions of minimal examples of graphs for which the resulting classes differ. We also relate these classes of graphs to the notion of $k$-dismantlable graphs and $k$-collapsible complexes, which also leads to a minimal counterexample to an erroneous claim of Ivashchenko from the literature. We end with some open questions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。