The Erdős–Faber–Lovász conjecture is true for n ≤ 12

DOI10.1142/S1793830914500396zbMath1298.05133OpenAlexW2093535629WikidataQ122950166 ScholiaQ122950166MaRDI QIDQ2920887

Federico Alonso-Pecina, David Romero

Publication date: 29 September 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830914500396

zbMATH Keywords

tabu searchchromatic numberlinear spacehypergraph coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial structures in finite projective spaces (51E20)

Related Items (6)

Unnamed Item ⋮ Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz ⋮ The Erd\H{o}s--Faber--Lov\'{a}sz Conjecture revisited ⋮ New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ The Erdős–Faber–Lovász conjecture for the class of δEFL graphs

Cites Work

• The Erdős-Faber-Lovász conjecture -- the uniform regular case
• On topological relaxations of chromatic conjectures
• The Erdős-Faber-Lovász conjecture for dense hypergraphs
• A remark on the conjecture of Erdös, Faber and Lovász
• ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE
• On a Conjecture of Erdös, Faber, and Lovász about n-Colorings

This page was built for publication: The Erdős–Faber–Lovász conjecture is true for n ≤ 12