Timeline for Infinite $3$-chromatic hypergraphs
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 11, 2017 at 8:38 | history | edited | Dominic van der Zypen |
edited tags
|
|
| Jul 10, 2017 at 5:26 | comment | added | Péter Komjáth | I think this is relevant: P. Erdős, S. Shelah: Separability properties of almost-disjoint families of sets, Israel J. Math. 12 (1972), 207--214 renyi.mta.hu/~p_erdos/1972-21.pdf | |
| Jul 9, 2017 at 18:55 | comment | added | Dominic van der Zypen | The question of whether such a well-ordering is always possible could be a nice MO problem in its own right! | |
| Jul 9, 2017 at 17:31 | comment | added | Fedor Petrov | If we manage to well-order all edges so that each edge has less than $\kappa$ vertices of all previous edges, we may colour by transfinite induction. | |
| Jul 9, 2017 at 15:40 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |