Simplicial simple-homotopy of flag complexes in terms of graphs

@article{Boulet2010SimplicialSO,
  title={Simplicial simple-homotopy of flag complexes in terms of graphs},
  author={Romain Boulet and E. Fieux and B. Jouve},
  journal={Eur. J. Comb.},
  year={2010},
  volume={31},
  pages={161-176}
}
A flag complex can be defined as a simplicial complex whose simplices correspond to complete subgraphs of its 1-skeleton taken as a graph. In this article, by introducing the notion of s-dismantlability, we shall define the s-homotopy type of a graph and show in particular that two finite graphs have the same s-homotopy type if, and only if, the two flag complexes determined by these graphs have the same simplicial simple-homotopy type. This result is closely related to similar results… Expand

Figures and Topics from this paper

Foldings in graphs and relations with simplicial complexes and posets
Star clusters in independence complexes of graphs
A hierarchy of dismantlings in graphs
The Lusternik-Schnirelmann theorem for graphs
1 2 Fe b 20 19 k-dismantlability in graphs
...
1
2
...

References

SHOWING 1-10 OF 38 REFERENCES
Complexes of graph homomorphisms
S-homotopy for Finite Graphs
Posets, clique graphs and their homotopy type
The Hilbert Series of the Face Ring of a Flag Complex
  • P. Renteln
  • Mathematics, Computer Science
  • Graphs Comb.
  • 2002
A topological approach to evasiveness
Graph homotopy and Graham homotopy
Combinatorial Algebraic Topology
  • D. Kozlov
  • Computer Science, Mathematics
  • Algorithms and computation in mathematics
  • 2008
Convergence of iterated clique graphs
Constructions preserving evasiveness and collapsibility
  • V. Welker
  • Computer Science, Mathematics
  • Discret. Math.
  • 1999
...
1
2
3
4
...