WI-posets, graph complexes and Z_2-equivalences

Simple item page
dc.creatorZivaljevic, Rade T.
dc.date2004-05-21
dc.date.accessioned2026-07-07T05:08:28Z
dc.date.available2026-07-07T05:08:28Z
dc.descriptionWe introduce WI-posets as intermediate objects in the study of Z_2-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 Z_2-homotopy types are concerned. Among the applications are a proof that each finite, free Z_2-complex is a graph complex and an evaluation of Z_2-homotopy types of complexes Ind(C_n) of independence sets in a cycle C_n. The main tools used in the paper are Quillen fiber theorem and Bredon criterion for Z_2-equivalence of Z_2-complexes.
dc.identifierhttps://arxiv.org/abs/math/0405419
dc.identifierhttp://arxiv.org/abs/math/0405419
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71274
dc.subjectCombinatorics
dc.subjectAlgebraic Topology
dc.subject05C10; 05C15; 55P91; 06A07
dc.titleWI-posets, graph complexes and Z_2-equivalences
dc.typetext

Files

Collections

arXiv