Foldings in graphs and relations with simplicial complexes and posets

Details Foldings in graphs and relations with simplicial complexes and posets Foldings in graphs and relations with simplicial complexes and posets

2010-10-11

arxiv.org/abs/1010.2047v1

Mathematics

Combinatorics

15 pages, 10 figures, partially presented at the 8th French Combinatorial Conference (0rsay, 2010, 28 June - 2 July)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Foldings in graphs and relations with simplicial complexes and posets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Foldings in graphs and relations with simplicial complexes and posets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Foldings in graphs and relations with simplicial complexes and posets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-658634