WI-posets, graph complexes and Z2-equivalences
Rade T. Zivaljevic
Abstract
We introduce WI-posets as intermediate objects in the study of Z2-homotopy types of graph complexes. It turns out that (almost) all graph complexes associated to a graph can be viewed as avatars of the same object, as long as their Z2-homotopy types are concerned. Among the applications are a proof that each finite, free Z2-complex is a graph complex and an evaluation of Z2-homotopy types of complexes Ind(Cn) of independence sets in a cycle Cn. The main tools used in the paper are Quillen fiber theorem and Bredon criterion for Z2-equivalence of Z2-complexes.
Create a lesson
Related papers
Off-Diagonal Induced Ramsey Numbers
Bruno Andrades, Marcelo Campos, Rafael Filipe et al.
Largest Sperner families with bounded VC-dimension
Gennian Ge, Hanyu Wang, Zixiang Xu et al.
Proof of two conjectures on the log-concavity of partition ranks and cranks
Jianxi Mao, Wenle Shi, Bao-Xuan Zhu
The Exact Number of Pentagons in Book-Free Graphs
Wentao Hu
A family of symmetric counterexamples to the bent sum decomposition conjecture
Máté Róbert Kepes, Anita Kercsó-Molnár, Viczián András
Counting graphs admitting a strictly matched involution
Stephan Dominique Andres, Igor Režan