Hostname: page-component-74656f9884-7drmj Total loading time: 0 Render date: 2026-11-04T17:05:19.152Z Has data issue: false hasContentIssue false

A stability theorem for multi-partite graphs

Published online by Cambridge University Press:  11 August 2025

Wanfang Chen
Affiliation:
School of Mathematical Sciences Key Laboratory of MEA(Ministry of Education) Shanghai Key Laboratory of PMMP, East China Normal University, Shanghai, China
Changhong Lu
Affiliation:
School of Mathematical Sciences Key Laboratory of MEA(Ministry of Education) Shanghai Key Laboratory of PMMP, East China Normal University, Shanghai, China
Long-Tu Yuan*
Affiliation:
School of Mathematical Sciences Key Laboratory of MEA(Ministry of Education) Shanghai Key Laboratory of PMMP, East China Normal University, Shanghai, China
*
Corresponding author: Long-Tu Yuan; Email: ltyuan@math.ecnu.edu.cn
Rights & Permissions [Opens in a new window]

Abstract

The Erdős–Simonovits stability theorem is one of the most widely used theorems in extremal graph theory. We obtain an Erdős–Simonovits type stability theorem in multi-partite graphs. Different from the Erdős–Simonovits stability theorem, our stability theorem in multi-partite graphs says that if the number of edges of an $H$-free graph $G$ is close to the extremal graphs for $H$, then $G$ has a well-defined structure but may be far away from the extremal graphs for $H$. As applications, we strengthen a theorem of Bollobás, Erdős, and Straus and solve a conjecture in a stronger form posed by Han and Zhao concerning the maximum number of edges in multi-partite graphs which does not contain vertex-disjoint copies of a clique.

MSC classification

Information

Type
Paper
Copyright
© The Author(s), 2025. Published by Cambridge University Press
Figure 0

Figure 1. Illustration of Example1.6.

Figure 1

Figure 2. A hypothetical configuration with multiple partial sets.

Figure 2

Figure 3. A partition $ \mathcal{P}=(P_1,\ldots ,P_5)$ that is stable to $ \mathcal{V} = (V_1, \ldots , V_{12})$.

Figure 3

Figure 4. A bad edge $xy$ with $x\in V_{i_1},y\in V_{i_2}$.