Caihong Yang

works on

cartesian product of trees 1 extremal graph theory 1 r-degenerate graphs 1 star-flip graphs 1 turán numbers 1

From the 1 of 6 linked papers with an AI index.

collaborators

6 papers

cs.LG2026

CAKE: Compiler-Agent Co-Design for Frontier Kernel Evolution

Zihao Ye, Yingyi Huang, Hongyi Jin +11

GPU kernel agents and GPU programming languages have advanced separately, leaving expert kernels difficult to reproduce. Agents usually treat the compiler as a fixed black box and…

math.CO2026

The Turán number of the Cartesian product of trees via star-flip

Lanchao Wang, Caihong Yang

The paper proves a conjecture that the Turán number of the Cartesian product of any two nontrivial trees grows on the order of n^{3/2}, introduces r‑star‑flip graphs, and shows the…

math.CO2025

A hypergraph analogue of Alon-Frankl Theorem

Caihong Yang, Jiasheng Zeng, Xiao-Dong Zhang

Recently, Alon and Frankl (JCTB, 2024) determined the maximum number of edges in $K_{ℓ + 1}$ -free $n$ -vertex graphs with bounded matching number. For integers $ℓ \geq r \geq 2$ , t…

math.CO2025

Triple systems with bounded matching number: some constructions and exact TurÃ¡n number

Nannan Chen, Miao Liu, Yuzhen Qi +1

We study the TurÃ¡n numbers of $3$ -graphs avoiding $3$ -graphs $F$ and $M_{s + 1}^{3}$ , a matching of size $s + 1$ . We disprove a conjecture of Gerbner, Tompkins, and Zhou [European Journ…

math.CO2025

Generalized TurÃ¡n results for disjoint copies of degenerate graphs

Caihong Yang, Jiasheng Zeng

The generalized TurÃ¡n number $ex (n, H, F)$ denotes the maximum number of copies of $H$ in an $n$ -vertex $F$ -free graph. For an integer $t \geq 1$ , let $tF$ be the vertex-…

math.CO2025

Exact TurÃ¡n densities in triple systems

Nannan Chen, Yuzhen Qi, Caihong Yang +1

In this paper, we prove several new TurÃ¡n density results for $3$ -graphs. We show: $I ¨ (C_{4}^{3}, complement of F_{5}) = 23 - 3$ , $Ï(F_{3,2}, C_5^{3-}) = \frac{2}{9}…