Timeline for Coloring the edges of a torus graph
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 14, 2014 at 19:53 | vote | accept | Daniel Soltész | ||
| Dec 14, 2014 at 1:17 | answer | added | Daniel Soltész | timeline score: 3 | |
| Nov 28, 2014 at 18:22 | comment | added | Daniel Soltész | I managed to show that $k$ color changes are enough. Still working on $k-1$ changes. | |
| Nov 11, 2014 at 8:32 | comment | added | domotorp | Nice, thanks! I had worked on the original conjecture where the edge coloring was also required to be antipodal, but have not heard about this new, stronger version. | |
| Nov 10, 2014 at 21:38 | comment | added | Daniel Soltész | @domotorp Link added. I can also talk about the connections between the result of Feder and Subi, and this question. There is also an other paper of Leader and Long about the hypercube version. | |
| Nov 10, 2014 at 21:33 | history | edited | Daniel Soltész | CC BY-SA 3.0 |
added 122 characters in body
|
| Nov 10, 2014 at 20:41 | comment | added | domotorp | Could you add a link to the hypercube problem? | |
| Nov 10, 2014 at 14:50 | comment | added | Aaron Meyerowitz | Then I'd lean toward it being true. Consider for each point the closest thing which can not be reached in $k$ color changes. Maybe that would be effective. | |
| Nov 10, 2014 at 14:21 | comment | added | Daniel Soltész | Thank you, edited it to be $k>1$. When $k=1$ the torus structure does not help yet. | |
| Nov 10, 2014 at 14:19 | history | edited | Daniel Soltész | CC BY-SA 3.0 |
added 45 characters in body
|
| Nov 10, 2014 at 7:05 | comment | added | Aaron Meyerowitz | It is not true for $k=1.$ | |
| Nov 10, 2014 at 5:50 | history | edited | Daniel Soltész | CC BY-SA 3.0 |
edited tags; edited title
|
| Nov 10, 2014 at 5:44 | history | asked | Daniel Soltész | CC BY-SA 3.0 |