Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2403.09518 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929276537798656 |
|---|---|
| author | Bretto, Alain Faisant, Alain Hennecart, François |
| author_facet | Bretto, Alain Faisant, Alain Hennecart, François |
| contents | We show that the chromatic index of a hypergraph $\mathcal{H}$ satisfies Berge-Füredi conjectured bound $\mathrm{q}(\mathcal{H})\le Δ([\mathcal{H}]_2)+1$ under certain hypotheses on the antirank $\mathrm{ar}(\mathcal{H})$ or on the maximum degree $Δ(\mathcal{H})$. This provides sharp information in connection with Erdős-Faber-Lovász Conjecture which deals with the coloring of a family of cliques that intersect pairwise in at most one vertex. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_09518 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | About Berge-Füredi's conjecture on the chromatic index of hypergraphs Bretto, Alain Faisant, Alain Hennecart, François Combinatorics 05C15 We show that the chromatic index of a hypergraph $\mathcal{H}$ satisfies Berge-Füredi conjectured bound $\mathrm{q}(\mathcal{H})\le Δ([\mathcal{H}]_2)+1$ under certain hypotheses on the antirank $\mathrm{ar}(\mathcal{H})$ or on the maximum degree $Δ(\mathcal{H})$. This provides sharp information in connection with Erdős-Faber-Lovász Conjecture which deals with the coloring of a family of cliques that intersect pairwise in at most one vertex. |
| title | About Berge-Füredi's conjecture on the chromatic index of hypergraphs |
| topic | Combinatorics 05C15 |
| url | https://arxiv.org/abs/2403.09518 |