I would like to know if there exists a version of the König's theorem for tripartite graphs.

In other words, let G = (V,T) be a tripartite graph, with V set of vertices ($V$ union of three disjoint subsets $A,B,C$) and T set of triples $\{v_1,v_2,v_3\}$, with $v_1 \in A, v_2 \in B, v_3 \in C$. We say *maximum 3 - matching* the maximum number of triples such that for any pair of them there are no vertices in common.

Any suggestions or references? Thanks in advance!