Bounds on Erd?s - Faber - Lovász conjecture - the uniform and regular cases

Simple item page
dc.contributor.authorHegde, S.M.
dc.contributor.authorDara, S.
dc.date.accessioned2026-02-03T13:20:52Z
dc.date.issued2025
dc.description.abstractWe 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.
dc.identifier.citationElectronic Journal of Graph Theory and Applications, 2025, 13, 1, pp. 117-121
dc.identifier.issn23382287
dc.identifier.urihttps://doi.org/10.5614/ejgta.2025.13.1.8
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/20697
dc.publisherIndonesian Combinatorics Society
dc.subjectchromatic number
dc.subjectErd?s - Faber - Lovász conjecture
dc.subjecthypergraphs
dc.titleBounds on Erd?s - Faber - Lovász conjecture - the uniform and regular cases

Files

Collections

Journal Articles