  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.
