2016/05/09 by Reza Jafarpour-Golzari, Jafarpour-Golzari, Reza, Rashid Zaare-Nahandi +1 · 1 citation
Computer Science · Engineering · Mathematics · #5C65 (Secondary) #5E40 (Primary) #Advanced Graph Theory Research #Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1605.02655
openalex publication_date 2016/05/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.