The chromatic index of simple hypergraphs

DOI10.1007/BF01788081MaRDI QIDQ1073804zbMATH OpenOpenAlexFDO

Authors Zoltán Füredi

Publication date 1986

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01788081

zbMATH Keywords

hypergraphmatching numberchromatic indexneighborhood of a vectorVizing's TheoremErdős-Faber-Lovász conjecture

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• Chromatic index of simple hypergraphs
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• scientific article; zbMATH DE number 736299
• A note on the Erdős--Farber--Lovász conjecture
• scientific article; zbMATH DE number 4214051

Cites work

• scientific article; zbMATH DE number 4198041 (Why is no real title available?)
• On a Conjecture of Erdös, Faber, and Lovász about n-Colorings
• Packing nearly-disjoint sets
• The chromatic index of cyclic Steiner 2-designs
• Une propriété extremale des plans projectifs finis dans une classe de codes équidistants

Cited in

(20)

• A note on the Erdős--Farber--Lovász conjecture
• scientific article; zbMATH DE number 736299 (Why is no real title available?)
• A sharpening of Fisher's inequality
• A method of finding automorphism groups of endomorphism monoids of relational systems.
• A note on edge coloring of linear hypergraphs
• The Erdős–Faber–Lovász conjecture for the class of δEFL graphs
• Motivations and history of some of my conjectures
• scientific article; zbMATH DE number 7232795 (Why is no real title available?)
• The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs
• On the degree, size, and chromatic index of a uniform hypergraph
• Graph and hypergraph colouring via nibble methods: a survey
• Chromatic index of simple hypergraphs
• A proof of the Erdős-Faber-Lovász conjecture
• The list chromatic index of simple graphs whose odd cycles intersect in at most one edge
• Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree
• On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs
• A fractional version of the Erdős-Faber-Lovász conjecture
• scientific article; zbMATH DE number 4214033 (Why is no real title available?)
• Chromatic index of hypergraphs and Shannon's theorem
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász

This page was built for publication: The chromatic index of simple hypergraphs

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