Linear colorings of simplicial complexes and collapsing
Yusuf Civan, Ergun Yalcin
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
Related papers
A face polynomial invariant for embedded graphs
Hongxia Ma, Metrose Metsidik
Odd-ordered Cayley graphs satisfy Erdős--Gyárfás
Michael C. Burkhart
The Maximum Second Zagreb Spectral Radius of Trees, Unicyclic Graphs and Bicyclic Graphs
Juan Wang, Genjie Wang
A Low-Diameter Nash-Williams--Tutte Theorem
Pin-Hsian Lee, Peng-Ting Lin, Meng-Tsung Tsai et al.
A Short Proof and Generalization of the Rainbow Cycle Theorem and Improved Bounds for Binary Even-Query LCCs
Andrew D. Lin
Automaticity of structural defects in fixed points of block substitutions
Lior Tenenbaum