Abstract :
Let G be a 3-partite graph with 3n vertices, n in each class, such that each vertex is connected to at least 23n+n of the vertices in each of the other two classes. In this paper it will be proved that G contains n vertex-disjoint triangles, it will also be shown by example that this is close to being sharp.