2024/03/14 by Alain Bretto, Alain Faisant, Bretto, Alain +3
Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Topology and Set Theory #Advanced Graph Theory Research
paper · pdf · doi:10.48550/arxiv.2403.09518
We show that the chromatic index of a hypergraph H satisfies Berge-Füredi conjectured bound q(H)≤ Δ([H]2)+1 under certain hypotheses on the antirank ar(H) or on the maximum degree Δ(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.