The Erdos-Faber-Lovasz conjecture for weakly dense hypergraphs

Published 12 Oct 2020 in math.CO | (2010.05666v1)

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 k² vertices. In our main result, we prove the famous Erdos-Faber-Lovasz conjecture when the hypergraph is weakly dense.

Abstract PDF Upgrade to Chat

Authors (1)

Guillermo Alesandroni

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.