Bounds on Erdős - Faber - Lovász Conjecture - the Uniform and Regular Cases

2018/06/21 by S. M. Hegde, Hegde, S. M., Suresh Dara +1
Mathematics · #Advanced Algebra and Geometry #Analytic Number Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Geometric and Algebraic Topology

paper · pdf · doi:10.48550/arxiv.1806.08154

openalex publication_date 2018/06/21 · openalex created_date 2024/04/11 · openalex updated_date 2026/07/28

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

Related

• A proof of the Erdős-Faber-Lovász conjecture
• Linear Hypergraph Edge Coloring
• A Proof of the Erdös - Faber - Lovász Conjecture
• On Erdos-Faber-Lovasz Conjecture
• About maximal number of edges in hypergraph-clique with chromatic number\n 3