Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/dm/BalDY11
%A Bal, Deepak
%A Dudek, Andrzej
%A Yilma, Zelealem B.
%D 2011
%J Discret. Math.
%K dblp
%N 21
%P 2577-2580
%T On the maximum number of edges in a hypergraph with a unique perfect matching.
%U http://dblp.uni-trier.de/db/journals/dm/dm311.html#BalDY11
%V 311
@article{journals/dm/BalDY11,
added-at = {2021-02-12T00:00:00.000+0100},
author = {Bal, Deepak and Dudek, Andrzej and Yilma, Zelealem B.},
biburl = {https://www.bibsonomy.org/bibtex/28e3c82e48f12364700a6d60ebaaca3f7/dblp},
ee = {https://doi.org/10.1016/j.disc.2011.07.016},
interhash = {c52d10e07f2323c270356dc3cdb5a65c},
intrahash = {8e3c82e48f12364700a6d60ebaaca3f7},
journal = {Discret. Math.},
keywords = {dblp},
number = 21,
pages = {2577-2580},
timestamp = {2024-04-09T03:50:13.000+0200},
title = {On the maximum number of edges in a hypergraph with a unique perfect matching.},
url = {http://dblp.uni-trier.de/db/journals/dm/dm311.html#BalDY11},
volume = 311,
year = 2011
}