𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Every connected space has the homology of a K(π,1)

✍ Scribed by D.M. Kan; W.P. Thurston


Publisher
Elsevier Science
Year
1976
Tongue
English
Weight
456 KB
Volume
15
Category
Article
ISSN
0040-9383

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Every longest circuit of a 3-connected,
✍ Etienne Birmelé 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 1 views

## Abstract Carsten Thomassen conjectured that every longest circuit in a 3‐connected graph has a chord. We prove the conjecture for graphs having no __K__~3,3~ minor, and consequently for planar graphs. © 2008 Wiley Periodicals, Inc. J Graph Theory 58: 293–298, 2008

The square of a connected S(K1,3)-free g
✍ George Hendry; Walter Vogler 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

We prove the conjecture of Gould and Jacobson that a connected S(K1,J free graph has a vertex pancyclic square. Since .S(K1,J is not vertex pancyclic, this result is best possible. ## Our notation generally follows that used in [l] . A graph G is Hamilroniun if it contains a cycle through all its

The existence of a 2-factor in K1, n-fre
✍ R. E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n ≥ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.

Search for aCaenorhabditis elegans FMR1
✍ Shtang, Sharon; Perry, Marc D.; Percy, Maire E. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 19 KB 👁 2 views

A mixed stage gt10 Caenorhabditis elegans cDNA library was screened with a probe derived by polymerase chain reaction from the double K homology (KH) domain of mouse FMR1 cDNA, a region that is highly conserved in the human, mouse, chicken, and frog FMR1 proteins. Four positively hybridizing cDNAs w