arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.13271math.ATmath.CO
收藏

图的森林滤链

The Forest Filtration of a Graph

Andrés Carnero Bravo

AI总结:

本文通过构造图的森林滤链,研究独立复形到无环顶点集复形的过渡,证明其性质并计算多类图的同伦型,进而给出去环数推广及三元图斐波那契数的上界。

摘要:

给定一个图 $G$,我们定义了与 $G$ 相关联的单纯复形滤链 $\mathcal{F}_0(G)\subseteq\mathcal{F}_1(G)\subseteq\cdots\subseteq\mathcal{F}_\infty(G)$,其中第一个复形是独立复形,最后一个复形由无环顶点集构成。我们证明了该滤链的一些性质,并计算了各类图的同伦型。我们利用这些复形的有理上同调群的维数,给出了去环数及其参数推广的上界。我们还推导了三元图的斐波那契数的上界。

英文摘要:

Given a graph $G$, we define a filtration of simplicial complexes associated to $G$, $\mathcal{F}_0(G)\subseteq\mathcal{F}_1(G)\subseteq\cdots\subseteq\mathcal{F}_\infty(G)$ where the first complex is the independence complex and the last the complex is formed by the acyclic sets of vertices. We prove some properties of this filtration and we calculate the homotopy type for various families of graphs. We give an upper bound for the decycling number and generalizations of this parameter using the dimensions of the rational cohomology groups of these complexes. We also derive an upper bound for the Fibonacci numbers of ternary graphs.

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

↑