Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 13, No 1 (2025): Electronic Journal of Graph Theory and Applications

Bounds on Erdos - Faber - Lovász conjecture - the uniform and regular cases

Hegde, Suresh M. (Department of Mathematical and Computational Sciences, \\National Institute of Technology Karnataka, Surathkal, Mangalore, India)
Dara, Suresh (Birla Institute of Technology, Mesra, Ranchi, India)

Article Info

Publish Date
28 Apr 2025

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.

Copyrights © 2025




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Electronic Journal of Graph Theory and Applications (EJGTA)
Website

Abbrev

ejgta

Publisher

Indonesian Combinatorial Society

Subject

Electrical & Electronics Engineering

Description

The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to all areas of modern graph theory together with applications to other fields of mathematics, computer science and other sciences. The journal is published by the Indonesian Combinatorial Society ...