Skip to main navigation
Skip to search
Skip to main content

University of Birmingham Home

Help & FAQ

Home
Research output
Profiles
Research units
Projects
Activities
Datasets
Equipment
Prizes
Press/Media

Search by expertise, name or affiliation

Matching in hypergraphs of large minimum degree

Daniela Kuhn, Deryk Osthus

Mathematics

Research output: Contribution to journal › Article

54 Citations (Scopus)

Overview
Fingerprint

Fingerprint

Dive into the research topics of 'Matching in hypergraphs of large minimum degree'. Together they form a unique fingerprint.

Sort by
Weight
Alphabetically

Mathematics

Powered by Pure, Scopus & Elsevier Fingerprint Engine™

All content on this site: Copyright © 2024 Elsevier B.V. or its licensors and contributors. All rights are reserved, including those for text and data mining, AI training, and similar technologies. For all open access content, the Creative Commons licensing terms apply

We use cookies to help provide and enhance our service and tailor content. By continuing you agree to the use of cookies

University of Birmingham data protection policy

About web accessibility

Report vulnerability