Timeline for Singular homology of a graph.
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 28, 2010 at 18:11 | answer | added | Steven Sam | timeline score: 3 | |
| May 16, 2010 at 11:18 | vote | accept | Xandi Tuni | ||
| May 15, 2010 at 12:59 | comment | added | Xandi Tuni | This would have contradicted Robin's answer and Torsten's comment to it, which suggest that, say for the icosahedron-graph, (or also for any cycle of size $\geq 4$) we have nontrivial $H_2$ (respectively $H_1$). | |
| May 15, 2010 at 12:54 | comment | added | Tyler Lawson | I had an erroneous answer here based on recognizing that the associated simplicial set is the coskeleton of its 1-skeleton, and that the chain complex computes the homology of the geometric realization of this simplicial set. This is still true, but the associated simplicial set is not fibrant and so one needs to do more work to determine the homotopy type. | |
| May 15, 2010 at 11:02 | answer | added | Robin Chapman | timeline score: 3 | |
| May 15, 2010 at 10:02 | history | asked | Xandi Tuni | CC BY-SA 2.5 |