Unmixed d-uniform r-partite hypergraphs
classification
🧮 math.AC
math.CO
keywords
d-uniformhypergraphsconditiongivematchingperfectr-partiteunmixed
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.