Nearly perfect matchings in regular simple hypergraphs
New bounds on matchings in \(k\)-uniform regular hypergraphs with \(k\geq 3\) and such that every two edges share at most one vertex are proved. In particular, an improved bound on matchings in Steiner triple systems is obtained.
scientific article; zbMATH DE number 1062361