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

DOI10.4153/CJM-1981-046-9MaRDI QIDQ3932976zbMATH OpenWikidataFDO

Authors Neil Hindman

Publication date 1981

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

Full work available at URL https://doi.org/10.4153/CJM-1981-046-9

zbMATH Keywords

n-coloringsmall intersection family

Mathematics Subject Classification ID

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

Recommendations

• Advances on the Erdős-Faber-Lovász conjecture
• A coloring problem related to the Erdős, Faber, Lovasz conjecture
• On the Erdős-Faber-Lovász Conjecture.
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• A remark on the conjecture of Erdös, Faber and Lovász

Cited in

(24)

• The chromatic index of simple hypergraphs
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• A coloring problem related to the Erdős, Faber, Lovasz conjecture
• Packing nearly-disjoint sets
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
• Motivations and history of some of my conjectures
• Chromatic index of hypergraphs and Shannon's theorem
• b-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
• Chromatic index of simple hypergraphs
• The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs
• Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz
• On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs
• Hypercubes defined on \(n\)-ary sets, the Erdös-Faber-Lovász conjecture on graph coloring, and the description spaces of polypeptides and RNA
• On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture
• The Erdős-Faber-Lovász conjecture is true for n 12
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• scientific article; zbMATH DE number 7232795 (Why is no real title available?)
• Advances on the Erdős-Faber-Lovász conjecture
• scientific article; zbMATH DE number 3561377 (Why is no real title available?)
• The Erdős–Faber–Lovász conjecture for the class of δEFL graphs
• Two Chromatic Conjectures: One for Vertices and One for Edges
• Monomial invariants applied to graph coloring
• Coloring unions of nearly disjoint hypergraph cliques
• A method of finding automorphism groups of endomorphism monoids of relational systems.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3932976)