Coloring nearly-disjoint hypergraphs with n + o(n) colors

doi:10.1016/0097-3165(92)90096-D

Journal of Combinatorial Theory, Series A

Volume 59, Issue 1, January 1992, Pages 31-39

https://doi.org/10.1016/0097-3165(92)90096-D Get rights and content

Under an Elsevier user license

open archive

Abstract

It is shown that the chromatic index of a nearly-disjoint hypergraph on n vertices is at most n + o(n). This is an approximate version of the well-known conjecture of Erdős, Faber, and Lovász stating that the chromatic index is at most n.

Cited by (0)

^☆: Supported in part by NSF DMS.87-83558 and AFOSR Grants 89-0066, 89-0512, and 90-0008.

Journal of Combinatorial Theory, Series A

Coloring nearly-disjoint hypergraphs with n + o(n) colors☆

Abstract