scientific article
From MaRDI portal
Publication:3218168
zbMath0555.05054MaRDI QIDQ3218168
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Generalizations and strengthenings of Ryser's conjecture ⋮ The feasible matching problem ⋮ Coverings and matchings in r-partite hypergraphs ⋮ Matching and domination numbers in \(r\)-uniform hypergraphs ⋮ Small edge sets meeting all triangles of a graph ⋮ Covering random graphs with monochromatic trees ⋮ Ryser's conjecture for \(t\)-intersecting hypergraphs ⋮ Covers in partitioned intersecting hypergraphs ⋮ The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four ⋮ Extremal hypergraphs for Ryser's conjecture ⋮ On Ryser's conjecture for linear intersecting multipartite hypergraphs ⋮ Domination and matching in power and generalized power hypergraphs ⋮ Nonintersecting Ryser Hypergraphs ⋮ Matchings and covers in hypergraphs ⋮ Estimates of the independence number of a hypergraph and the Ryser conjecture ⋮ A comment on Ryser's conjecture for intersecting hypergraphs ⋮ Monochromatic coverings and tree Ramsey numbers
This page was built for publication:
