📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

New bounds on the size of nearly perfect matchings in almost regular hypergraphs (2023)

First Author: Kang, Dong Yeap

Attributed to: Combinatorics, Probability and Algorithms funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.3929/ethz-b-000626500

Publication URI: http://hdl.handle.net/20.500.11850/626500

Type: Other