The Erdos-Faber-Lovasz conjecture for weakly dense hypergraphs
Combinatorics
2020-10-13 v1
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^2 vertices. In our main result, we prove the famous Erdos-Faber-Lovasz conjecture when the hypergraph is weakly dense.
Cite
@article{arxiv.2010.05666,
title = {The Erdos-Faber-Lovasz conjecture for weakly dense hypergraphs},
author = {Guillermo Alesandroni},
journal= {arXiv preprint arXiv:2010.05666},
year = {2020}
}
Comments
graph coloring; combinatorics