Adjunction of n-equivalences and triad connectivity.
Witbooi, Peter J.
Publicacions Matemàtiques, Tome 39 (1995), p. 367-377 / Harvested from Biblioteca Digital de Matemáticas
Access to full text

We prove a new adjunction theorem for n-equivalences. This theorem enables us to produce a simple geometric version of proof of the triad connectivity theorem of Blakers and Massey. An important intermediate step is a study of the collapsing map S∨X → S, S being a sphere.

Publié le : 1995-01-01
DMLE-ID : 3770 
@article{urn:eudml:doc:41229,
     title = {Adjunction of n-equivalences and triad connectivity.},
     journal = {Publicacions Matem\`atiques},
     volume = {39},
     year = {1995},
     pages = {367-377},
     mrnumber = {MR1370893},
     zbl = {0858.55011},
     language = {en},
     url = {http://dml.mathdoc.fr/item/urn:eudml:doc:41229}
}

Witbooi, Peter J. Adjunction of n-equivalences and triad connectivity.. Publicacions Matemàtiques, Tome 39 (1995) pp. 367-377. http://gdmltest.u-ga.fr/item/urn:eudml:doc:41229/