About Berge-F\"uredi's conjecture on the chromatic index of hypergraphs
Combinatorics
2024-03-15 v1
Abstract
We show that the chromatic index of a hypergraph satisfies Berge-F\"uredi conjectured bound under certain hypotheses on the antirank or on the maximum degree . This provides sharp information in connection with Erd\H{o}s-Faber-Lov\'asz Conjecture which deals with the coloring of a family of cliques that intersect pairwise in at most one vertex.
Keywords
Cite
@article{arxiv.2403.09518,
title = {About Berge-F\"uredi's conjecture on the chromatic index of hypergraphs},
author = {Alain Bretto and Alain Faisant and François Hennecart},
journal= {arXiv preprint arXiv:2403.09518},
year = {2024}
}