Timeline for On a connectivity property of set systems
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 23 at 17:36 | comment | added | Dominic van der Zypen | That's right, will do it. | |
| Feb 23 at 8:59 | comment | added | bof | Don't you think the question about hypergraphs should be replaced by the simpler but equivalent question about graphs? | |
| Feb 16 at 0:06 | comment | added | bof | Maybe I'm missing something but it seems to me that a hypergraph $\mathcal A$ satisfies your two conditions if and only if the ordinary graph $\bigcup_{A\in\mathcal A}[A]^2$ satisfies them. So you are asking if there is a graph $G$ with chromatic number $\chi(G)\gt\kappa$ which does not have the complete graph $K_\kappa$ as a minor. Am I right? | |
| Feb 15 at 18:05 | history | edited | Dominic van der Zypen | CC BY-SA 4.0 |
added 13 characters in body
|
| Apr 29, 2021 at 11:43 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |