Dadong Peng

activity

20242026

collaborators

3 papers

math.CO2026

Turán number of three disjoint cliques of arbitrary sizes

Alexandr Kostochka, Dadong Peng, Zimu Xiang +1

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 \geq q \geq r \geq 2$ and $n \geq p + q + r$ , we…

math.CO2025

Turán number of four vertex-disjoint cliques

Alexandr Kostochka, Dadong Peng, Liang Zhang

Given a graph $H$ , the Turán number $ex (n, H)$ of $H$ is the maximum number of edges of an $n$ -vertex simple graph containing no $H$ as a subgraph. Let $k K_{p}$ denote the disjo…

math.CO2024

On the off-diagonal unordered Erdős-Rado numbers

Igor Araujo, Dadong Peng

Erdős and Rado [P. Erdős, R. Rado, A combinatorial theorem, Journal of the London Mathematical Society 25 (4) (1950) 249-255] introduced the Canonical Ramsey numbers $er (t)$ …