Pages that link to "Item:Q2905303"
From MaRDI portal
The following pages link to ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE (Q2905303):
Displaying 8 items.
- New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture (Q503615) (← links)
- Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz (Q2168069) (← links)
- Two smaller upper bounds of List injective chromatic number (Q2253957) (← links)
- Lower bounds on circuit depth of the quantum approximate optimization algorithm (Q2687096) (← links)
- The Erdős–Faber–Lovász conjecture is true for n ≤ 12 (Q2920887) (← links)
- (Q3303467) (← links)
- Further results on Erdős–Faber–Lovász conjecture (Q5154633) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
