📣 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 (2020)

First Author: Kang D

Attributed to: Approximate structure in large graphs and hypergraphs funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.2010.04183

Publication URI: https://arxiv.org/abs/2010.04183

Type: Other