scientific article; zbMATH DE number 850071

zbMATH Open0842.05067MaRDI QIDQ4866085FDOQ4866085

Authors J. Kahn

Publication date 28 July 1996

zbMATH Keywords

hypergraphscoloring problemsrandom matchings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 981679
• scientific article; zbMATH DE number 736299
• On Erdős' extremal problem on matchings in hypergraphs

Cited in

(6)

• scientific article; zbMATH DE number 981679 (Why is no real title available?)
• A proof of the Erdős-Faber-Lovász conjecture
• On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs
• Graph and hypergraph colouring via nibble methods: a survey
• Graph theory. Abstracts from the workshop held January 2--8, 2022
• scientific article; zbMATH DE number 736299 (Why is no real title available?)

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 Q4866085)