Timeline for Maximizing "happy" vertices in splitting an infinite graph
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 14, 2019 at 19:37 | comment | added | Juho | FWIW, if you search for "happy coloring", you'll come across the problem of completing the partial vertex-coloring of a graph so as to maximize the number of happy edges (an edge is happy if its endpoints have the same color). There is a vertex variant as well, where the goal is to maximize the number of vertices whose neighborhood has received the same color. These problems might be motivated by team-building applications. | |
| Mar 9, 2019 at 8:06 | comment | added | Dominic van der Zypen | @kodlu At times it felt as if it did ;-) | |
| Mar 9, 2019 at 0:04 | comment | added | kodlu | But your party surely didn't have an infinite number of kids :-) | |
| Mar 8, 2019 at 11:35 | vote | accept | Dominic van der Zypen | ||
| Mar 8, 2019 at 9:48 | answer | added | Fedor Petrov | timeline score: 2 | |
| Mar 8, 2019 at 9:01 | history | edited | Dominic van der Zypen | CC BY-SA 4.0 |
added 72 characters in body
|
| Mar 8, 2019 at 8:59 | comment | added | Dominic van der Zypen | Right - I want to exclude $S \in \{\emptyset, V\}$ - thanks for your remark! | |
| Mar 8, 2019 at 8:43 | comment | added | Fedor Petrov | if $S=V$, are all happy? | |
| Mar 8, 2019 at 8:36 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |