Further results on Erdős–Faber–Lovász conjecture
In 1972, Erdős–Faber–Lovász (EFL) conjectured that, if is a linear hypergraph consisting of edges of cardinality , then it is possible to color the vertices with colors so that no two vertices with the same color are in the same edge. In 1978, Deza, Erdös and Frankl had given an equivalent version o...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.03.003 |