Nearly perfect matchings in regular simple hypergraphs (Q1366948)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1062361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nearly perfect matchings in regular simple hypergraphs |
scientific article; zbMATH DE number 1062361 |
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
0.8729794025421143
0 references
0.8662890195846558
0 references
0.8644482493400574
0 references
0.8533684611320496
0 references
