Timeline for How many non-overlapping k-hop neighborhoods can be uniquely colored on an $N$-dimensional hypercube?
Current License: CC BY-SA 3.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Nov 6, 2012 at 13:02 | history | edited | StoicPorpoise | CC BY-SA 3.0 |
edited body
|
Nov 6, 2012 at 12:42 | history | edited | StoicPorpoise | CC BY-SA 3.0 |
added 26 characters in body
|
Nov 6, 2012 at 12:40 | answer | added | Ben Barber | timeline score: 1 | |
Nov 6, 2012 at 9:37 | history | edited | StoicPorpoise | CC BY-SA 3.0 |
added 42 characters in body
|
Nov 6, 2012 at 9:13 | history | edited | StoicPorpoise |
edited tags
|
|
Nov 6, 2012 at 9:02 | history | edited | StoicPorpoise | CC BY-SA 3.0 |
added 317 characters in body; added 66 characters in body; added 1 characters in body
|
Nov 6, 2012 at 8:53 | history | asked | StoicPorpoise | CC BY-SA 3.0 |