Foldings in graphs and relations with simplicial complexes and posets
From MaRDI portal
(Redirected from Publication:442383)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 5704224 (Why is no real title available?)
- scientific article; zbMATH DE number 5704228 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- A fixed point theorem for finite partially orderes sets
- A simple proof for folds on both sides in complexes of graph homomorphisms
- Combinatorial algebraic topology
- Complexes of graph homomorphisms
- Dismantlability Revisited for Ordered Sets and Graphs and the Fixed-Clique Property
- Dismantlable graphs and posets, fixed clique property
- Equivariant collapses and the homotopy type of iterated clique graphs
- Finite Topological Spaces
- Fixed points in partially ordered sets
- Hom complexes and homotopy theory in the category of graphs
- Isotone relations and the fixed point property for posets
- Kneser's conjecture, chromatic number, and homotopy
- Linear colorings of simplicial complexes and collapsing
- On bridged graphs and cop-win graphs
- On multiplicative graphs and the product conjecture
- On retractable sets and the fixed point property
- Simplicial simple-homotopy of flag complexes in terms of graphs
- Stable Algebraic Topology and Stable Topological Algebra
- Strong homotopy types, nerves and collapses
- Vertex-to-vertex pursuit in a graph
Cited in
(20)- Infinitesimal and \(B_{\infty}\)-algebras, finite spaces, and quasi-symmetric functions
- A simple proof for folds on both sides in complexes of graph homomorphisms
- A note on independence complexes of chordal graphs and dismantling
- Dismantlability Revisited for Ordered Sets and Graphs and the Fixed-Clique Property
- On the deformation retract of Eguchi-Hanson space and its folding
- Simplicial maps of graphs that factor through an arc
- Posets, clique graphs and their homotopy type
- Homomorphism reconfiguration via homotopy
- Fundamental groupoids for graphs
- Computing persistent homology of flag complexes via strong collapses
- scientific article; zbMATH DE number 5211465 (Why is no real title available?)
- Mixing homomorphisms, recolorings, and extending circular precolorings
- scientific article; zbMATH DE number 6289085 (Why is no real title available?)
- A homotopy category for graphs
- Strong collapse and persistent homology
- A hierarchy of dismantlings in graphs
- \(s\)-homotopy for finite graphs
- scientific article; zbMATH DE number 6161194 (Why is no real title available?)
- Some topological properties of folded Petersen graph
- scientific article; zbMATH DE number 140331 (Why is no real title available?)
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)
