scientific article; zbMATH DE number 736299
From MaRDI portal
Publication:4326643
zbMath0820.05050MaRDI QIDQ4326643
Publication date: 27 August 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
covershypergraphsmatching numbermatchingsLatin squarechromatic index\(r\)-uniform intersecting hypergraphedge-covering number
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Combinatorial probability (60C05) Extremal set theory (05D05) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (14)
On even and odd latin squares ⋮ Fractional v. integral covers in hypergraphs of bounded edge size ⋮ Unnamed Item ⋮ List edge and list total colourings of multigraphs ⋮ Clique versus independent set ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs ⋮ On the binary and Boolean rank of regular matrices ⋮ A counterexample to the Alon-Saks-Seymour conjecture and related problems ⋮ On partitioning two matroids into common independent subsets ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ On the relations of various conjectures on Latin squares and straightening coefficients ⋮ Some colouring problems for Paley graphs
This page was built for publication:
