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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Density Conditions for k Vertex‐Disjoint Triangles in Tripartite Graphs

Klas Markström, Mingyang Guo
Journal of Graph Theory
Limits and Structures in Graph Theory
article

Density Conditions for k Vertex‐Disjoint Triangles in Tripartite Graphs

Klas Markström, Mingyang Guo
article en

Abstract

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 .

Journal of Graph Theory
Zhengzhou University (CN), Umeå University (SE)
China Scholarship Council
Openalex Percentile: Top 3%
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.