Pages that link to "Item:Q3932976"

The following pages link to On a Conjecture of Erdös, Faber, and Lovász about <i>n</i>-Colorings (Q3932976):

Displaying 20 items.

• A method of finding automorphism groups of endomorphism monoids of relational systems. (Q879337) (← links)
• The chromatic index of simple hypergraphs (Q1073804) (← links)
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász (Q1112832) (← links)
• Packing nearly-disjoint sets (Q1168975) (← links)
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors (Q1185879) (← links)
• Motivations and history of some of my conjectures (Q1356729) (← links)
• Chromatic index of hypergraphs and Shannon's theorem (Q1580680) (← links)
• \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture (Q1949110) (← links)
• Chromatic index of simple hypergraphs (Q2005680) (← links)
• The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs (Q2032720) (← links)
• Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz (Q2168069) (← links)
• On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs (Q2198387) (← links)
• On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture (Q2905303) (← links)
• The Erdős-Faber-Lovász conjecture is true for \(n \leq 12\) (Q2920887) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• (Q3303467) (← links)
• The Erdős–Faber–Lovász conjecture for the class of δEFL graphs (Q5013484) (← links)
• Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
• Monomial invariants applied to graph coloring (Q6116562) (← links)
• Coloring unions of nearly disjoint hypergraph cliques (Q6144279) (← links)