About Berge-Füredi's conjecture on the chromatic index of hypergraphs

Abstract

We show that the chromatic index of a hypergraph $\mathcal{H}$ satisfies Berge-Füredi conjectured bound $\mathrm{q}(\mathcal{H})\le \Delta ([\mathcal{H}{]}_2)+1$ under certain hypotheses on the antirank $\mathrm{ar}(\mathcal{H})$ or on the maximum degree $\Delta (\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.