Further results on Erdős–Faber–Lovász conjecture

DOI10.1016/j.akcej.2019.03.003zbMath1473.05089OpenAlexW2923758900WikidataQ123121499 ScholiaQ123121499MaRDI QIDQ5154633

S. M. Hegde, Suresh Dara

Publication date: 5 October 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2019.03.003

zbMATH Keywords

chromatic numbersymmetric Latin squareErdős-Faber-Lovász conjecture

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The Erd\H{o}s--Faber--Lov\'{a}sz Conjecture revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the Erdős--Farber--Lovász conjecture
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• On the combinatorial problems which I would most like to see solved
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
• The Erdős-Faber-Lovász conjecture for dense hypergraphs
• ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE
• Reconstruction of a Pair of Graphs from their Concatenations
• Intersection Properties of Systems of Finite Sets
• A clone-theoretic formulation of the Erdős-Faber-Lovász conjecture
• On the completion of latin rectangles to symmetric latin squares

This page was built for publication: Further results on Erdős–Faber–Lovász conjecture