Timeline for Flooding a cycle digraph via chip-firing: $n^{k-1} + n^{k-2} + \cdots + 1$ bound (a Norway 1998-99 problem generalized)
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 17, 2017 at 0:38 | history | edited | darij grinberg | CC BY-SA 3.0 |
typo
|
| Feb 28, 2015 at 15:32 | vote | accept | darij grinberg | ||
| Feb 27, 2015 at 22:02 | answer | added | Fedor Petrov | timeline score: 4 | |
| Feb 27, 2015 at 19:19 | history | edited | darij grinberg | CC BY-SA 3.0 |
(typos--)--
|
| Feb 27, 2015 at 5:32 | history | asked | darij grinberg | CC BY-SA 3.0 |