scientific article; zbMATH DE number 7232795
From MaRDI portal
Publication:3303467
Cites work
- A clone-theoretic formulation of the Erdős-Faber-Lovász conjecture
- A note on Erdős-Faber-Lovász conjecture and edge coloring of complete graphs.
- A note on the Erdős--Farber--Lovász conjecture
- A remark on the conjecture of Erdös, Faber and Lovász
- Adding evidence to the Erdős-Faber-Lovász conjecture
- Advances on the Erdős-Faber-Lovász conjecture
- Chromatic graph theory
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
- scientific article; zbMATH DE number 3651315 (Why is no real title available?)
- scientific article; zbMATH DE number 3523543 (Why is no real title available?)
- scientific article; zbMATH DE number 3547317 (Why is no real title available?)
- scientific article; zbMATH DE number 3634284 (Why is no real title available?)
- scientific article; zbMATH DE number 1016456 (Why is no real title available?)
- scientific article; zbMATH DE number 3241107 (Why is no real title available?)
- New families of n-clusters verifying the Erdős-Faber-Lovász conjecture
- On a Conjecture of Erdös, Faber, and Lovász about n-Colorings
- On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture
- On the chromatic index of a finite projective space
- On the combinatorial problems which I would most like to see solved
- On the Erdős-Faber-Lovász Conjecture.
- Properties of the Steiner triple systems of order 19
- The chromatic index of cyclic Steiner 2-designs
- The chromatic index of projective triple systems
- The chromatic index of simple hypergraphs
- The Erdős-Faber-Lovász conjecture -- the uniform regular case
- The Erdős-Faber-Lovász conjecture is true for n 12
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3303467)
