Studies edge density conditions for vertex-disjoint triangles in tripartite graphs, indicating optimal thresholds.
Let be positive integers such that and be a tripartite graph with parts such that . Denote the edge densities of and by and , respectively. In this paper, we study edge density conditions for the existence of vertex‐disjoint triangles in a tripartite graph. For we give an optimal condition in terms of densities for the existence of vertex‐disjoint triangles in . We also give an optimal condition in terms of densities for the existence of a triangle‐factor in .
No takes yet. Share an insight, caveat, or question.
Guo et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: