Timeline for Conjecture on connected hypergraphs
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 8, 2022 at 21:01 | comment | added | Louis D | Also in the case of finite graphs, this would give by far the best known approximate version of Hadwiger's conjecture (only off by 1). | |
| Apr 8, 2022 at 20:41 | comment | added | Louis D | Unless I'm missing some subtle difference, it seems like you already asked this question three months ago... mathoverflow.net/questions/413206/… | |
| Apr 8, 2022 at 12:26 | comment | added | Will Sawin | Your conjecture cannot be weaker because it includes graphs as a special case. | |
| Apr 8, 2022 at 9:25 | comment | added | Dominic van der Zypen | @WillSawin If you replace hyperedges by cliques, you change the chromatic number. For instance if ${\cal E}$ is a countable collection of infinite subsets of $\omega$, then $(\omega, {\cal E})$ is colorable with $2$ colors, but if you replace every hyperedge with a clique, then the resulting graph has chromatic number $\aleph_0$. So this conjecture is much weaker. | |
| Apr 8, 2022 at 2:46 | comment | added | Zach Hunter | for the graph case, is it possible that not being $\kappa$-colorable could be weakened to not being $(\kappa-1)$-degenerate? | |
| Apr 7, 2022 at 20:03 | comment | added | Will Sawin | By replacing hyperedges with cliques, this conjecture would follow from the special case of graphs, so there is no need to consider hypergraphs. | |
| Apr 7, 2022 at 19:46 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |