A note on edge coloring of linear hypergraphs

DOI10.3770/J.ISSN:2095-2651.2023.05.003MaRDI QIDQ6076845FDOQ6076845

Authors:

Publication date: 22 September 2023

Recommendations

• On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture
• On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs
• Edge-coloring linear hypergraphs with medium-sized edges
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• The Erdős-Faber-Lovász conjecture for dense hypergraphs

zbMATH Keywords

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

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

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: A note on edge coloring of linear hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076845)