scientific article; zbMATH DE number 736299

MaRDI QIDQ4326643zbMATH OpenFDO

Authors J. Kahn

Publication date 27 August 1995

zbMATH Keywords

hypergraphsmatching numberLatin squarematchingscoverschromatic index\(r\)-uniform intersecting hypergraphedge-covering number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Orthogonal arrays, Latin squares, Room squares (05B15) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Extremal set theory (05D05)

Recommendations

• scientific article; zbMATH DE number 981679
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• The chromatic index of simple hypergraphs
• scientific article; zbMATH DE number 850071

Cited in

(16)

• Some colouring problems for Paley graphs
• scientific article; zbMATH DE number 981679 (Why is no real title available?)
• A proof of the Erdős-Faber-Lovász conjecture
• List edge and list total colourings of multigraphs
• Two Chromatic Conjectures: One for Vertices and One for Edges
• Graph and hypergraph colouring via nibble methods: a survey
• On the binary and Boolean rank of regular matrices
• Problems and invariants connected with bicliques and multicliques of graphs
• On partitioning two matroids into common independent subsets
• The chromatic index of simple hypergraphs
• New bounds on the size of nearly perfect matchings in almost regular hypergraphs
• On even and odd latin squares
• Fractional v. integral covers in hypergraphs of bounded edge size
• A counterexample to the Alon-Saks-Seymour conjecture and related problems
• Clique versus independent set
• On the relations of various conjectures on Latin squares and straightening coefficients

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