New bounds on the size of nearly perfect matchings in almost regular hypergraphs
Work
Year: 2023
Type: article
Abstract: Let be a ‐uniform ‐regular simple hypergraph on vertices. Based on an analysis of the Rödl nibble, in 1997, Alon, Kim and Spencer proved that if , then contains a matching covering all but at most ve... more
Institutions University of Birmingham, ETH Zurich
Cites: 38
Cited by: 2
Related to: 10
FWCI: 1.007
Citation percentile (by year/subfield): 54.31
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $3,710
Funders Horizon 2020 Framework Programme, Engineering and Physical Sciences Research Council, Engineering and Physical Sciences Research Council
Grant IDS 786198, EP/S00100X/1, EP/N019504/1