About Berge-F\"uredi's conjecture on the chromatic index of hypergraphs
Abstract
We show that the chromatic index of a hypergraph H satisfies Berge-F\"uredi 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 Erdos-Faber-Lov\'asz Conjecture which deals with the coloring of a family of cliques that intersect pairwise in at most one vertex.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.