📣 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.

Perfectly packing graphs with bounded degeneracy and many leaves (2022)

First Author: Allen P

Attributed to: The sparse hypergraph regularity method funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/s11856-022-2447-7

Publication URI: http://dx.doi.org/10.1007/s11856-022-2447-7

Type: Journal Article/Review

Parent Publication: Israel Journal of Mathematics

Issue: 2