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
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.