Pages that link to "Item:Q1112832"
From MaRDI portal
The following pages link to Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász (Q1112832):
Displaying 20 items.
- New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture (Q503615) (← links)
- A coloring problem related to the Erdős, Faber, Lovasz conjecture (Q1117945) (← 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)
- Constructing sparse Davenport-Schinzel sequences (Q2182209) (← links)
- Concepts on coloring of cluster hypergraphs with application (Q2196923) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE (Q2905303) (← 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)
- (Q6076845) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
- Monomial invariants applied to graph coloring (Q6116562) (← links)
- Coloring unions of nearly disjoint hypergraph cliques (Q6144279) (← links)
