Linear colorings of simplicial complexes and collapsing

Details Linear colorings of simplicial complexes and collapsing Linear colorings of simplicial complexes and collapsing

2006-04-28

arxiv.org/abs/math/0604628v1

Mathematics

Combinatorics

18 pages

Scientific paper

A vertex coloring of a simplicial complex $\Delta$ is called a linear coloring if it satisfies the property that for every pair of facets $(F_1, F_2)$ of $\Delta$, there exists no pair of vertices $(v_1, v_2)$ with the same color such that $v_1\in F_1\backslash F_2$ and $v_2\in F_2\backslash F_1$. We show that every simplicial complex $\Delta$ which is linearly colored with $k$ colors includes a subcomplex $\Delta'$ with $k$ 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.

Affiliated with

Also associated with

No associations

Rating

Linear colorings of simplicial complexes and collapsing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear colorings of simplicial complexes and collapsing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear colorings of simplicial complexes and collapsing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-326830