Timeline for Minimizing the set of monochromatic edges
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 31, 2021 at 20:22 | vote | accept | Dominic van der Zypen | ||
| Jan 31, 2021 at 6:34 | answer | added | bof | timeline score: 1 | |
| Jan 28, 2021 at 10:58 | comment | added | Dominic van der Zypen | Oh, right -- thanks @bof! | |
| Jan 27, 2021 at 21:07 | comment | added | Dominic van der Zypen | That's right @SamHopkins - sorry for not specifying this in the post. For finite $H$, the poset ${\cal M}(H,\kappa)$ is finite as well, so it contains minimal elements, i.e. $\text{Min}({\cal M}(H,\kappa))\neq \varnothing$ . | |
| Jan 27, 2021 at 13:35 | comment | added | Sam Hopkins | So just to be clear the hypergraph $H$ itself may be infinite? Does that mean both infinite number of vertices, infinite number of edges, and possibly the edges contain infinitely many vertices? | |
| Jan 27, 2021 at 13:31 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |