Linear colorings of simplicial complexes and collapsing

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…