1
$\begingroup$

There are polynomial algorithms for finding a maximum weighted matching on a bipartite graph, e.g. the hungarian algorithm. Is there such an algorithm for a tripartite 3-uniform hypergraph? What about a k-partite k-uniform hypergraph?

1 Answers 1

4

It turns out that this is called 3-dimensional matching, and it's known to be an NP-hard problem. So the answer is no.