Nearly perfect matchings in regular simple hypergraphs
- 1 December 1997
- journal article
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 100 (1) , 171-187
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Asymptotically Optimal Covering DesignsJournal of Combinatorial Theory, Series A, 1996
- Asymptotically Good List-ColoringsJournal of Combinatorial Theory, Series A, 1996
- The Ramsey number R(3, t) has order of magnitude t2/log tRandom Structures & Algorithms, 1995
- Asymptotic packing via a branching processRandom Structures & Algorithms, 1995
- Asymptotic behavior of the chromatic index for hypergraphsJournal of Combinatorial Theory, Series A, 1989
- Near Perfect Coverings in Graphs and HypergraphsEuropean Journal of Combinatorics, 1985
- On a Packing and Covering ProblemEuropean Journal of Combinatorics, 1985
- On the Size of a Maximum Transversal in a Steiner Triple SystemCanadian Journal of Mathematics, 1981
- A Dense Infinite Sidon SequenceEuropean Journal of Combinatorics, 1981
- A Note on Partial Parallel Classes in Steiner SystemsDiscrete Mathematics, 1978