On a Conjecture of Erdös, Faber, and Lovász about n-Colorings

DOI10.4153/CJM-1981-046-9zbMath0476.05009WikidataQ56390941 ScholiaQ56390941MaRDI QIDQ3932976

Neil Hindman

Publication date: 1981

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

n-coloringsmall intersection family

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05)

Related Items (20)

Unnamed Item ⋮ ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE ⋮ Motivations and history of some of my conjectures ⋮ The Erdős–Faber–Lovász conjecture is true for n ≤ 12 ⋮ Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász ⋮ Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz ⋮ A method of finding automorphism groups of endomorphism monoids of relational systems. ⋮ Monomial invariants applied to graph coloring ⋮ Coloring unions of nearly disjoint hypergraph cliques ⋮ On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs ⋮ \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture ⋮ Packing nearly-disjoint sets ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors ⋮ Chromatic index of simple hypergraphs ⋮ The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs ⋮ Chromatic index of hypergraphs and Shannon's theorem ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ The Erdős–Faber–Lovász conjecture for the class of δEFL graphs ⋮ The chromatic index of simple hypergraphs

This page was built for publication: On a Conjecture of Erdös, Faber, and Lovász about n-Colorings