2 papers
math.CO2025
Turán number of four vertex-disjoint cliques
Alexandr Kostochka, Dadong Peng, Liang Zhang
Given a graph , the Turán number of is the maximum number of edges of an -vertex simple graph containing no as a subgraph. Let 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 …