Nearly perfect matchings in regular simple hypergraphs (Q1366948): Difference between revisions
From MaRDI portal
Revision as of 17:54, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearly perfect matchings in regular simple hypergraphs |
scientific article |
Statements
Nearly perfect matchings in regular simple hypergraphs (English)
0 references
17 September 1997
0 references
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.
0 references
matchings
0 references
regular hypergraphs
0 references
Steiner triple systems
0 references
0 references
