scientific article; zbMATH DE number 7741557

DOI10.3770/j.issn:2095-2651.2023.05.003MaRDI QIDQ6076845

No author found.

Publication date: 22 September 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

edge coloringlinear hypergraphErdős-Faber-Lovász conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• The chromatic index of simple hypergraphs
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• On the combinatorial problems which I would most like to see solved
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
• A fractional version of the Erdős-Faber-Lovász conjecture
• Chromatic index of hypergraphs and Shannon's theorem
• On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs
• Edge‐coloring linear hypergraphs with medium‐sized edges
• A proof of the Erdős-Faber-Lovász conjecture

This page was built for publication: