Timeline for A Question on 1, 2 ,3 Conjecture
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Dec 12, 2016 at 18:58 | history | bounty ended | Rahman. M | ||
| S Dec 12, 2016 at 18:58 | history | notice removed | Rahman. M | ||
| Dec 6, 2016 at 14:55 | comment | added | domotorp | Why exactly did you offer a bounty? Wasn't Flo's answer credible enough? | |
| S Dec 5, 2016 at 18:42 | history | bounty started | Rahman. M | ||
| S Dec 5, 2016 at 18:42 | history | notice added | Rahman. M | Authoritative reference needed | |
| S Apr 26, 2015 at 17:49 | history | edited | Michael Renardy | CC BY-SA 3.0 |
minor grammar improvements
|
| S Apr 26, 2015 at 17:49 | history | suggested | Sergiy Kozerenko | CC BY-SA 3.0 |
minor grammar improvements
|
| Apr 26, 2015 at 17:33 | review | Suggested edits | |||
| S Apr 26, 2015 at 17:49 | |||||
| Nov 9, 2013 at 19:38 | answer | added | Flo Pfender | timeline score: 19 | |
| Nov 9, 2013 at 18:24 | comment | added | The Masked Avenger | Ah! Neighboring vertices must get different colors. OK, I'll stop commenting for a bit. | |
| Nov 9, 2013 at 18:21 | comment | added | The Masked Avenger | So if I understand correctly, the problem is challenging only for degree regular graphs? (Otherwise we could color every edge with the color 1.) | |
| Nov 9, 2013 at 16:33 | comment | added | The Masked Avenger | Maybe I don't understand what a vertex proper coloring is. If I look at K_2,n where n is large enough I do not see how to get a good vertex coloring using a limited set of colors on the edges. | |
| Nov 9, 2013 at 9:43 | review | First posts | |||
| Nov 9, 2013 at 9:46 | |||||
| Nov 9, 2013 at 9:25 | history | asked | Rahman. M | CC BY-SA 3.0 |