Linear colorings of simplicial complexes and collapsing
Combinatorics
2007-05-23 v1 Algebraic Topology
Abstract
A vertex coloring of a simplicial complex is called a linear coloring if it satisfies the property that for every pair of facets of , there exists no pair of vertices with the same color such that and . We show that every simplicial complex which is linearly colored with colors includes a subcomplex with vertices such that is a strong deformation retract of . We also prove that this deformation is a nonevasive reduction, in particular, a collapsing.
Cite
@article{arxiv.math/0604628,
title = {Linear colorings of simplicial complexes and collapsing},
author = {Yusuf Civan and Ergun Yalcin},
journal= {arXiv preprint arXiv:math/0604628},
year = {2007}
}
Comments
18 pages