Unmixed d-uniform r-partite hypergraphs
Commutative Algebra
2016-10-04 v1 Combinatorics
Abstract
In this paper, we characterize all unmixed d-uniform r-partite hypergraphs under a certain condition. Also we give a necessary condition for unmixedness in d-uniform hypergraphs with a perfect matching of size n. Finally we give a sufficient condition for unmixednes in d-uniform hypergraphs with a perfect matching.
Cite
@article{arxiv.1605.02655,
title = {Unmixed d-uniform r-partite hypergraphs},
author = {Reza Jafarpour-Golzari and Rashid Zaare-Nahandi},
journal= {arXiv preprint arXiv:1605.02655},
year = {2016}
}
Comments
10 pages, 3 figurs