Timeline for Majority coloring for directed graphs
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 30, 2016 at 1:12 | answer | added | David Wood | timeline score: 5 | |
| May 5, 2016 at 8:26 | vote | accept | Dominic van der Zypen | ||
| May 4, 2016 at 15:50 | answer | added | Tony Huynh | timeline score: 6 | |
| Mar 16, 2016 at 18:23 | answer | added | Ilya Bogdanov | timeline score: 7 | |
| Mar 8, 2016 at 19:47 | comment | added | Dominic van der Zypen | Thats right, proving this would provide a negative answer to my question. | |
| Mar 8, 2016 at 16:15 | comment | added | logicute | Don't you rather conjecture that every graph is at most $3$-majority-colorable? Which amounts to saying that every graph can be partitioned in $C_1, C_2, C_3$ such that every vertex in $C_i$ doesn't have more edges coming from $C_i$ than from $V\setminus C_i$. | |
| Mar 7, 2016 at 15:42 | history | edited | Dominic van der Zypen | CC BY-SA 3.0 |
Question was not clear
|
| Mar 7, 2016 at 15:39 | comment | added | Dominic van der Zypen | Right - I'll edit my post accordingly. | |
| Mar 7, 2016 at 15:37 | comment | added | Benoît Kloeckner | Nice concept, but you should make clear what your question is. | |
| Mar 7, 2016 at 15:27 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |