Tur'an number of three disjoint cliques of arbitrary sizes

arXiv:2610.38430 · math.CO · Submitted 2026-10-28 · Read on arXiv

math.CO

Submitted: 2026-10-28

Updated: 2026-10-28

Comments: 26 pages

License: http://creativecommons.org/licenses/by/4.0/

The gist: The Turán number ex(n,H) of a given graph H is the maximum number of edges in an n-vertex H-free graph.

Abstract

The Turán number ex(n,H) of a given graph H is the maximum number of edges in an n-vertex H-free graph. In this paper, for all p at least q at least r at least 2 and n at least p+q+r, we determine the exact value of ex(n,K p K q K r) and describe all extremal graphs.

Related papers