Density Conditions for k Vertex‐Disjoint Triangles in Tripartite Graphs
ABSTRACT 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 .
Authors
- Klas Markström (ORCID: https://orcid.org/0000-0002-6344-1642)
- Mingyang Guo
Institutions
- Zhengzhou University (CN)
- Umeå University (SE)
Publication Details
- Journal
- Journal of Graph Theory
- Published
- 2026-06-19
- DOI
- https://doi.org/10.1002/jgt.70079
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- China Scholarship Council