Timeline for combinatorial lemma (is it well-known?)
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 12, 2014 at 22:13 | history | edited | user9072 | CC BY-SA 3.0 |
mj and tag
|
| Jan 27, 2013 at 7:17 | comment | added | Vivek Shende | there is a much simpler way to say the geometrical meaning: consider the standard $n+1$-simplex, with vertices $1, \ldots, n+2$. Then a coloring of the vertices of a triangulation is just the same thing as a simplicial map to this simplex. now the statement about the degree is obvious. | |
| Jan 27, 2013 at 0:31 | answer | added | Igor Pak | timeline score: 4 | |
| Jan 25, 2013 at 13:34 | history | edited | vaevictis |
edited tags
|
|
| Jan 25, 2013 at 13:29 | history | edited | vaevictis | CC BY-SA 3.0 |
added 2 characters in body; added 1 characters in body; added 6 characters in body
|
| Jan 25, 2013 at 13:22 | history | edited | vaevictis | CC BY-SA 3.0 |
deleted 1 characters in body; deleted 2 characters in body; added 1 characters in body; added 2 characters in body
|
| Jan 25, 2013 at 13:16 | history | asked | vaevictis | CC BY-SA 3.0 |