The Erdos-Faber-Lovasz conjecture for weakly dense hypergraphs
Abstract
Generalizing the concept of dense hypergraph, we say that a hypergraph is weakly dense, if no k in the half-open interval [2,sqrt(n)) is the degree of more than k2 vertices. In our main result, we prove the famous Erdos-Faber-Lovasz conjecture when the hypergraph is weakly dense.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.