Pages that link to "Item:Q868363"
From MaRDI portal
The following pages link to A note on the Erdős--Farber--Lovász conjecture (Q868363):
Displaying 16 items.
- New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture (Q503615) (← links)
- A note on Lovász removable path conjecture (Q635857) (← links)
- The chromatic index of simple hypergraphs (Q1073804) (← links)
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász (Q1112832) (← links)
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors (Q1185879) (← links)
- \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture (Q1949110) (← links)
- Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz (Q2168069) (← links)
- The Erdős-Faber-Lovász conjecture for dense hypergraphs (Q2470471) (← links)
- On the total chromatic number of Steiner systems (Q2708239) (← 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)
- (Q3303467) (← links)
- On two conjectures about edge-colouring hypergraphs (Q3360903) (← links)
- Further results on Erdős–Faber–Lovász conjecture (Q5154633) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
