Pages that link to "Item:Q2470471"

The following pages link to The Erdős-Faber-Lovász conjecture for dense hypergraphs (Q2470471):

Displaying 12 items.

• New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture (Q503615) (← links)
• \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture (Q1949110) (← 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 ≤ 12 (Q2920887) (← links)
• The Erdős–Faber–Lovász conjecture for the class of δEFL graphs (Q5013484) (← links)
• The Erd\H{o}s--Faber--Lov\'{a}sz Conjecture revisited (Q5027676) (← links)
• Further results on Erdős–Faber–Lovász conjecture (Q5154633) (← links)
• Edge‐coloring linear hypergraphs with medium‐sized edges (Q5236928) (← links)
• Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)