Timeline for Are hypergraphs $H=(V,E)$ with $|E|=|V|$ $2$-colorable?
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 26, 2019 at 16:50 | vote | accept | Dominic van der Zypen | ||
| Dec 26, 2019 at 13:36 | answer | added | Péter Komjáth | timeline score: 7 | |
| Dec 26, 2019 at 13:30 | comment | added | Dominic van der Zypen | Nice reformulation, thanks @MattF.! | |
| Dec 26, 2019 at 11:27 | comment | added | user44143 | Equivalently and more clearly: Let $S$ be an infinite set, e.g. $[0,1]$. Let $R$ be a region of $S\times S$ such that every vertical line has at least as many points inside as outside $R$. Can we color the horizontal lines in $S\times S$ red and blue so that each vertical line has both red and blue points in $R$? | |
| Dec 26, 2019 at 8:40 | review | Close votes | |||
| Jan 7, 2020 at 3:05 | |||||
| Dec 26, 2019 at 8:38 | history | edited | Dominic van der Zypen | CC BY-SA 4.0 |
added 32 characters in body
|
| Dec 26, 2019 at 8:37 | comment | added | Dominic van der Zypen | Sorry - forgot to add the condition that all members of $E$ have cardinality $|V|$ | |
| Dec 26, 2019 at 8:36 | history | undeleted | Dominic van der Zypen | ||
| Dec 26, 2019 at 6:06 | history | deleted | Dominic van der Zypen | via Vote | |
| Dec 26, 2019 at 2:48 | comment | added | Gerhard Paseman | Surely all two subsets of a three set will help form a counterexample. Gerhard "Maybe The Subsets Are Bigger?" Paseman, 2019.12.25. | |
| Dec 25, 2019 at 21:17 | comment | added | lambda | Surely an infinite complete graph is a counterexample... | |
| Dec 25, 2019 at 20:15 | review | Close votes | |||
| Dec 26, 2019 at 6:10 | |||||
| Dec 25, 2019 at 19:41 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |