Dara, Suresh
Birla Institute of Technology, Mesra, Ranchi, India

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Bounds on Erdos - Faber - Lovász conjecture - the uniform and regular cases Hegde, Suresh M.; Dara, Suresh
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 1 (2025): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2025.13.1.8

Abstract

We consider the Erds - 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.