Journal ArticleOPEN ACCESS

On the maximum number of edges in a hypergraph with a unique perfect matching

Discrete Mathematics (2011) 311(21) 2577-2580
DOI: 10.1016/j.disc.2011.07.016
3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this note, we determine the maximum number of edges of a k-uniform hypergraph, k<3, with a unique perfect matching. This settles a conjecture proposed by Snevily. © 2011 Elsevier B.V. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Bal, D., Dudek, A., & Yilma, Z. B. (2011). On the maximum number of edges in a hypergraph with a unique perfect matching. Discrete Mathematics, 311(21), 2577–2580. https://doi.org/10.1016/j.disc.2011.07.016

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free