Bounds on Erd?s - Faber - Lovász conjecture - the uniform and regular cases
No Thumbnail Available
Date
2025
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Indonesian Combinatorics Society
Abstract
We consider the Erd?s - Faber - Lovász (EFL) conjecture for hypergraphs. This paper gives an upper bound for the chromatic number of r regular linear hypergraphs H of size n. If r ? 4, ?(H) ? 1.181n and if r = 3, ?(H) ? 1.281n. © (2025), (Indonesian Combinatorics Society). All rights reserved.
Description
Keywords
chromatic number, Erd?s - Faber - Lovász conjecture, hypergraphs
Citation
Electronic Journal of Graph Theory and Applications, 2025, 13, 1, pp. 117-121