Timeline for A combinatorial identity
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 15, 2017 at 19:55 | history | edited | Fedor Petrov | CC BY-SA 3.0 |
added 2 characters in body
|
| Aug 15, 2017 at 15:13 | history | edited | Fedor Petrov | CC BY-SA 3.0 |
added 101 characters in body
|
| Aug 13, 2017 at 23:58 | comment | added | Honglu | Sorry about my ignorance and thank you for pointing out the right words! I am thinking about asking around, and your comment definitely helps. | |
| Aug 13, 2017 at 23:10 | comment | added | Alexander Woo | You need to talk to someone who's familiar with Volume 2 of Stanley. (This is more algebraic combinatorics than graph theory.) | |
| Aug 13, 2017 at 23:03 | history | edited | Alexander Woo | CC BY-SA 3.0 |
labelled - > marked (the vertices are already labelled $1,\ldots K$; you are marking a vertex in each component as special)
|
| Aug 13, 2017 at 18:41 | comment | added | Honglu | Thank you! This is a really cool argument, especially for me who doesn't have a lot of experiences in graph theory. I will mark this as the correct answer, but of course any further ideas and comments about question 2 are welcomed as well. | |
| Aug 13, 2017 at 18:38 | vote | accept | Honglu | ||
| Aug 13, 2017 at 13:53 | history | answered | Fedor Petrov | CC BY-SA 3.0 |