Timeline for A Question on 1, 2 ,3 Conjecture
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 12, 2016 at 18:58 | history | bounty ended | Rahman. M | ||
| Nov 10, 2013 at 3:44 | comment | added | Flo Pfender | The specific method there works only for arithmetic progressions, I doubt it could really do much here. This does not mean that some other tricky greedy method does not work, though. For good references on related problems, there is a survey by Ben Seamone: arxiv.org/abs/1211.5122 | |
| Nov 9, 2013 at 19:54 | comment | added | Daniel Soltész | I was also thinking along these lines, but didn't know about the name "neighbor distinguishing colorings by multisets" so i didn't find anything. I'm half way through the paper by you, Kalkowski and Karonski (math.ucdenver.edu/~fpfender/papers/22.pdf) where you prove something what may be called the "1,2,3,4,5 conjecture". I'll finish it anyway but since you understand it mutch better i'd like to ask: What do you think does the method used there might be helpful for this question? | |
| Nov 9, 2013 at 19:38 | history | answered | Flo Pfender | CC BY-SA 3.0 |