Turán problem for three disjoint cliques
For integers and , determine the maximum number of edges in an -vertex graph containing no subgraph isomorphic to , namely determine , and characterize all -vertex graphs attaining this maximum.
References
- Turán number of three disjoint cliques of arbitrary sizes — arXiv — Alexandr Kostochka, Dadong Peng, Zimu Xiang, Liang Zhang
Source: arXiv
Progress summary
An unrefereed paper claims to determine the exact answer for forbidding any three disjoint cliques, while cases involving four or more cliques remain open.
The problem asks for the maximum number of edges in an -vertex graph containing no three disjoint cliques , , and , together with all extremal graphs.
October 2026 exact-value claim
Alexandr Kostochka, Dadong Peng, Zimu Xiang, and Liang Zhang claim exact values and all extremal graphs for and . This would settle the full three-clique problem, but the preprint is unrefereed. The corresponding problem for four or more disjoint cliques remains outside scope.
Current status (as of October 2026): The three-clique case is claimed solved for all and , subject to verification; cases with four or more disjoint cliques remain open.
Sources
Solutions 0
No solutions have been posted yet.