English

Linear colorings of simplicial complexes and collapsing

Combinatorics 2007-05-23 v1 Algebraic Topology

Abstract

A vertex coloring of a simplicial complex Δ\Delta is called a linear coloring if it satisfies the property that for every pair of facets (F1,F2)(F_1, F_2) of Δ\Delta, there exists no pair of vertices (v1,v2)(v_1, v_2) with the same color such that v1F1\F2v_1\in F_1\backslash F_2 and v2F2\F1v_2\in F_2\backslash F_1. We show that every simplicial complex Δ\Delta which is linearly colored with kk colors includes a subcomplex Δ\Delta' with kk vertices such that Δ\Delta' is a strong deformation retract of Δ\Delta. We also prove that this deformation is a nonevasive reduction, in particular, a collapsing.

Keywords

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

R2 v1 2026-07-22T17:35:06.212Z