Nearly perfect matchings in regular simple hypergraphs
type: Item
instance of: scholarly article
title: Nearly perfect matchings in regular simple hypergraphs
zbMATH Open document ID: 0882.05107
DOI: 10.1007/BF02773639
author: Noga Alon
author: Jeong Han Kim
author: Joel Spencer
published in: Israel Journal of Mathematics
publication date: 1997-09-17T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05B07
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 1062361
zbMATH Keywords: matchings
zbMATH Keywords: regular hypergraphs
zbMATH Keywords: Steiner triple systems
reviewed by: Vladimir D. Tonchev
MaRDI profile type: Publication
cites work: A dense infinite Sidon sequence
cites work: Q4004078
cites work: On the Size of a Maximum Transversal in a Steiner Triple System
cites work: Q5734432
cites work: Near perfect coverings in graphs and hypergraphs
cites work: Asymptotically optimal covering designs
cites work: More-than-nearly-perfect packings and partial designs
cites work: Asymptotically good list-colorings
cites work: The Ramsey number R(3, t) has order of magnitude t2/log t
cites work: A note on partial parallel classes in Steiner systems
cites work: Asymptotic behavior of the chromatic index for hypergraphs
cites work: On a packing and covering problem
cites work: Q4885222
cites work: Asymptotic packing via a branching process
cites work: On the Size of Partial Parallel Classes in Steiner Systems
full work available at URL: https://doi.org/10.1007/bf02773639
OpenAlex ID: W1971289435
description: scientific article; zbMATH DE number 1062361