Paper Info
Title
A Note on Perfect Matchings in Uniform Hypergraphs.
Abstract
We determine the exact minimum l-degree threshold for perfect matchings in k-uniform hypergraphs when the corresponding threshold for perfect fractional matchings is significantly less than 2 ((n)(k-l)). This extends our previous results that determine the minimum l-degree thresholds for perfect matchings in k-uniform hyper graphs for all l >= k/2 and provides two new (exact) thresholds: (k, l) = (5, 2) and (7, 3).
Year
Venue
Keywords
2016
ELECTRONIC JOURNAL OF COMBINATORICS
perfect matchings,hypergraphs,absorbing method
Field
DocType
Volume
Discrete mathematics,Combinatorics,Constraint graph,Mathematics
Journal
23.0
Issue
ISSN
Citations 
1.0
1077-8926
2
PageRank 
References 
Authors
0.40
8
2
Name
Order
Citations
PageRank
Andrew Treglown19915.16
Yi Zhao2406.92