Skip to content

Linear colorings of simplicial complexes and collapsing

Yusuf Civan, Ergun Yalcin

math.COarXiv:math/0604628

Abstract

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

Create a lesson