Timeline for Building graphs as unions of disjoint edges
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 13, 2013 at 9:39 | comment | added | Nick Gill | @Tom, you're quite right. I forgot to specify that $n$ was even. | |
| Nov 12, 2013 at 22:07 | vote | accept | edgecoloring | ||
| Nov 12, 2013 at 17:50 | comment | added | Tom Leinster | @NickGill, doesn't it only say that when $n$ is even? Consider $n = 3$. | |
| Nov 12, 2013 at 17:05 | answer | added | Daniel Soltész | timeline score: 5 | |
| Nov 12, 2013 at 16:07 | answer | added | Nathann Cohen | timeline score: 3 | |
| Nov 12, 2013 at 15:58 | comment | added | Nick Gill | Theorem 4.4 of orion.math.iastate.edu/burstein/2003/math314/gt2003decomp.pdf asserts that $K_n$ is decomposable using $n-1$ subgraphs. | |
| Nov 12, 2013 at 15:55 | review | First posts | |||
| Nov 12, 2013 at 15:57 | |||||
| Nov 12, 2013 at 15:40 | history | asked | edgecoloring | CC BY-SA 3.0 |