The Forest Filtration of a Graph

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Bravo, Andrés Carnero
Formato: Preprint
Publicado: 2023
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866915194980007936
author Bravo, Andrés Carnero
author_facet Bravo, Andrés Carnero
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2307_13271
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle The Forest Filtration of a Graph
Bravo, Andrés Carnero
Algebraic Topology
Combinatorics
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.
title The Forest Filtration of a Graph
topic Algebraic Topology
Combinatorics
url https://arxiv.org/abs/2307.13271