Foldings in graphs and relations with simplicial complexes and posets

From MaRDI portal
Publication:442383

DOI10.1016/J.DISC.2011.11.026zbMATH Open1246.05157arXiv1010.2047OpenAlexW2070855922MaRDI QIDQ442383FDOQ442383


Authors: Etienne Fieux, J. Lacaze Edit this on Wikidata


Publication date: 10 August 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We study dismantlability in graphs. In order to compare this notion to similar operations in posets (partially ordered sets) or in simplicial complexes, we prove that a graph G dismants on a subgraph H if and only if H is a strong deformation retract of G. Then, by looking at a triangle relating graphs, posets and simplicial complexes, we get a precise correspondence of the various notions of dismantlability in each framework. As an application, we study the link between the graph of morphisms from a graph G to a graph H and the polyhedral complex Hom(G,H); this gives a more precise statement about well known results concerning the polyhedral complex Hom(G,H) and its relation with foldings in G or H.


Full work available at URL: https://arxiv.org/abs/1010.2047




Recommendations




Cites Work


Cited In (20)





This page was built for publication: Foldings in graphs and relations with simplicial complexes and posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442383)