Unmixed d-uniform r-partite hypergraphs
Reza Jafarpour-Golzari, Rashid Zaare-Nahandi
TL;DR
This paper characterizes unmixed d-uniform r-partite hypergraphs, providing necessary and sufficient conditions for unmixedness, especially in hypergraphs with perfect matchings, advancing understanding of their structural properties.
Contribution
It offers a complete characterization of unmixed d-uniform r-partite hypergraphs and establishes new necessary and sufficient conditions related to perfect matchings.
Findings
Characterization of all unmixed d-uniform r-partite hypergraphs under specific conditions
Necessary condition for unmixedness in d-uniform hypergraphs with perfect matchings
Sufficient condition for unmixedness in d-uniform hypergraphs with perfect matchings
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Graph Theory Research · Limits and Structures in Graph Theory