Timeline for Chromatic index of hypergraphs
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 18, 2021 at 17:52 | comment | added | Louis D | Sorry, in my above comment, change the $G$'s to $H$'s. | |
| Nov 18, 2021 at 15:21 | comment | added | Louis D | This doesn't sound like the case you are interested in, but when $\Delta(H)\leq (1-o(1))t|V(G)|$ with $t\geq 2$, Kang, Kelly, K\"uhn, Methuku, and Osthus proved that the chromatic index is at most $t|V(G)|$ (and thus at most $(1+o(1))\Delta(H)$) under the additional assumption that the co-degree is at most $t$. arxiv.org/pdf/2110.06181.pdf This is a generalization of the Erd\H{o}s, Faber, Lov\'asz conjecture (which they also recently proved). | |
| Nov 18, 2021 at 10:50 | comment | added | W. Paul Liu | Yes, by adjacent edges I mean intersecting edges. | |
| Nov 18, 2021 at 10:17 | comment | added | Fedor Petrov | This question is studied a lot, but as far as I know better bounds in full generality are not proved even for $k=3$, see for instance doi.org/10.1016/j.dam.2016.06.009 | |
| Nov 18, 2021 at 10:02 | comment | added | Fedor Petrov | By adjacent edges you mean intersecting edges? | |
| Nov 18, 2021 at 9:09 | history | asked | W. Paul Liu | CC BY-SA 4.0 |