Timeline for Coloring vertices in a cubic lattice graph and counting edges between vertices of identical and vertices of distinct coloration
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 6, 2014 at 19:21 | comment | added | The Masked Avenger | For large A, you can pack k^3 vertices to get s_2 to be 6k^2, so the problem of small k is of independent interest. | |
| Mar 6, 2014 at 17:48 | history | answered | The Masked Avenger | CC BY-SA 3.0 |