Timeline for "Drinking number" of a graph
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 24, 2021 at 9:05 | vote | accept | Dominic van der Zypen | ||
| Apr 23, 2021 at 5:56 | comment | added | Florian Lehner | Milner and Shelah not only show that there are graphs with no unfriendly 2-partition, they also prove that every graph has an unfriendly 3-partition | |
| Apr 23, 2021 at 0:13 | comment | added | bof | Could you briefly describe the Milner–Shelah uncountable counterexample, so that this won't be a "link-only" answer? Does their counterexample have dr(G) arbitrarily large, or just dr(G)=3? | |
| Apr 22, 2021 at 23:59 | comment | added | Sam Hopkins | Specifically, according to the link, it is open whether (in the language of the OP) $\mathrm{dr}(G)\leq 2$ for every countably infinite graph $G$. The link explains why for finite graphs $G$ this is easily seen to be true (as also mentioned in the comment of bof above). | |
| Apr 22, 2021 at 23:57 | review | First posts | |||
| Apr 23, 2021 at 6:01 | |||||
| Apr 22, 2021 at 23:56 | history | answered | user195625 | CC BY-SA 4.0 |