Corpus ID: 237503485

Minimal counterexamples for contractible graphs and related notions

  title={Minimal counterexamples for contractible graphs and related notions},
  author={Anton Dochtermann and Jesus F. Espinoza and Mart'in-Eduardo Fr'ias-Armenta and H'ector Alfredo Hern'andez-Hern'andez},
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… 

Figures from this paper


Hom complexes and homotopy theory in the category of graphs
A notion of x-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs is investigated, and a notion of homotopy equivalence is applied to the class of dismantlable graphs, which has several equivalent characterizations.
A counterexample on contractible transformations on graphs
In [A. V. Ivashchenko, Contractible transformations do not change the homology groups of graphs, Discrete Mathematics 126 (1) (1994) p 159,170], Ivashchenko started with the study of contractible
A hierarchy of dismantlings in graphs
A graph family, the cubion graphs, is introduced, in order to prove that k -dismantlabilities give a strict hierarchy in the class of graphs whose clique complex is non-evasive, and how higher dismantlabilities are related to the derivability of graphs defined by Mazurkievicz are pointed out.
Strong Homotopy Types, Nerves and Collapses
This work analyzes vertex-transitive simplicial G-actions and proves a particular case of the Evasiveness conjecture for simplicial complexes and reduces the general conjecture to the class of minimal complexes.
Gibbs Measures and Dismantlable Graphs
What appears to be a fundamental dichotomy of constraint graphs is investigated, by giving various characterizations of a class of graphs that is called dismantlable, by the space Hom(G, H) of homomorphisms from a locally finite graph G to a fixed finite constraint graph H.
Computing Persistent Homology of Flag Complexes via Strong Collapses
It is shown that strong collapses of flag complexes can be computed in time O(k^2 v^2) where v is the number of vertices of the complex and k is the maximal degree of its graph.
Canonical labeling of graphs
An algebraic approach to the problem of assigning canonical forms to graphs by computing canonical forms and the associated canonical labelings in polynomial time is announced.
A Note on Independence Complexes of Chordal Graphs and Dismantling
We show that the independence complex of a chordal graph is contractible if and only if this complex is dismantlable (strong collapsible) and it is homotopy equivalent to a sphere if and only if its
Graph homotopy and Graham homotopy
This paper introduces graph homotopy for graphs and Graham homotope for hypergraphs and study the relation between the two homotopies and the simple-homotopyFor cell complexes.
Dismantlings and iterated clique graphs
Here it is proved that if x is a dominated vertex, then G and G-{x} have the same dynamical behaviour under the iteration of the clique operator.