A note on Erd\"os-Faber-Lov\'asz Conjecture and edge coloring of complete graphs

zbMath1413.05098arXiv1605.03374MaRDI QIDQ2978308

Adrián Vázquez Ávila, Gabriela Araujo-Pardo

Publication date: 21 April 2017

Full work available at URL: https://arxiv.org/abs/1605.03374

zbMATH Keywords

chromatic numberintersecting hypergraphErdős-Faber-Lovász conjecture\(n\)-quasicluster

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

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 ⋮ On line colorings of finite projective spaces ⋮ On chromatic indices of finite affine spaces

This page was built for publication: A note on Erd\"os-Faber-Lov\'asz Conjecture and edge coloring of complete graphs