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

Deepak Bal, Andrzej Dudek, Zelealem B. Yilma

Research output: Contribution to journalArticleResearchpeer-review

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)2577-2580
Number of pages4
JournalDiscrete Mathematics
Volume311
Issue number21
DOIs
StatePublished - 6 Nov 2011

Fingerprint

Uniform Hypergraph
Perfect Matching
Hypergraph

Keywords

  • Hypergraph
  • Perfect matching

Cite this

Bal, Deepak ; Dudek, Andrzej ; Yilma, Zelealem B. / On the maximum number of edges in a hypergraph with a unique perfect matching. In: Discrete Mathematics. 2011 ; Vol. 311, No. 21. pp. 2577-2580.
@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 = "11",
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",
number = "21",

}

On the maximum number of edges in a hypergraph with a unique perfect matching. / Bal, Deepak; Dudek, Andrzej; Yilma, Zelealem B.

In: Discrete Mathematics, Vol. 311, No. 21, 06.11.2011, p. 2577-2580.

Research output: Contribution to journalArticleResearchpeer-review

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 - http://www.scopus.com/inward/record.url?scp=80052597023&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2011.07.016

DO - 10.1016/j.disc.2011.07.016

M3 - Article

VL - 311

SP - 2577

EP - 2580

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 21

ER -