scientific article; zbMATH DE number 736299
zbMATH Open0820.05050MaRDI QIDQ4326643FDOQ4326643
Authors: J. Kahn 
Publication date: 27 August 1995
Title of this publication is not available (Why is that?)
Recommendations
hypergraphsmatching numberLatin squarematchingscoverschromatic index\(r\)-uniform intersecting hypergraphedge-covering number
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)
Cited In (16)
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs
- A counterexample to the Alon-Saks-Seymour conjecture and related problems
- Clique versus independent set
- Some colouring problems for Paley graphs
- On even and odd latin squares
- List edge and list total colourings of multigraphs
- Fractional v. integral covers in hypergraphs of bounded edge size
- Two Chromatic Conjectures: One for Vertices and One for Edges
- The chromatic index of simple hypergraphs
- On partitioning two matroids into common independent subsets
- Graph and hypergraph colouring via nibble methods: a survey
- Title not available (Why is that?)
- A proof of the Erdős-Faber-Lovász conjecture
- Problems and invariants connected with bicliques and multicliques of graphs
- On the relations of various conjectures on Latin squares and straightening coefficients
- On the binary and Boolean rank of regular matrices
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)
