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

Deepak Bal; Andrzej Dudek; Zelealem B. Yilma

doi:10.1016/j.disc.2011.07.016

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

Deepak Bal
, Andrzej Dudek
, Zelealem B. Yilma

Mathematics

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

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.

Original language	English
Pages (from-to)	2577-2580
Number of pages	4
Journal	Discrete Mathematics
Volume	311
Issue number	21
DOIs	https://doi.org/10.1016/j.disc.2011.07.016
State	Published - 6 Nov 2011

Keywords

Hypergraph
Perfect matching

Access to Document

10.1016/j.disc.2011.07.016

Cite this

@article{73471392f4024acba429bfa5a6f06a30,

title = "On the maximum number of edges in a hypergraph with a unique perfect matching",

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.",

keywords = "Hypergraph, Perfect matching",

author = "Deepak Bal and Andrzej Dudek and Yilma, \{Zelealem B.\}",

year = "2011",

month = nov,

day = "6",

doi = "10.1016/j.disc.2011.07.016",

language = "English",

volume = "311",

pages = "2577--2580",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "21",

}

TY - JOUR

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

AU - Bal, Deepak

AU - Dudek, Andrzej

AU - Yilma, Zelealem B.

PY - 2011/11/6

Y1 - 2011/11/6

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

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

KW - Hypergraph

KW - Perfect matching

UR - https://www.scopus.com/pages/publications/80052597023

U2 - 10.1016/j.disc.2011.07.016

DO - 10.1016/j.disc.2011.07.016

M3 - Article

AN - SCOPUS:80052597023

SN - 0012-365X

VL - 311

SP - 2577

EP - 2580

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 21

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this