Pages that link to "Item:Q543987"
From MaRDI portal
The following pages link to The Erdős-Faber-Lovász conjecture -- the uniform regular case (Q543987):
Displaying 11 items.
- New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture (Q503615) (← 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 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)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)