Caihong Yang

collaborators

2 papers

math.CO2023

Counting triangles in graphs without vertex disjoint odd cycles

Jianfeng Hou, Caihong Yang, Qinghou Zeng

Given two graphs $H$ and $F$ , the maximum possible number of copies of $H$ in an $F$ -free graph on $n$ vertices is denoted by $ex (n, H, F)$ . Let $(ℓ + 1) \cdot F$ denote…

math.CO2022

Generating non-jumps from a known one

Jianfeng Hou, Heng Li, Caihong Yang +1

Let $r \geq 2$ be an integer. The real number $α \in [0, 1]$ is a jump for $r$ if there exists a constant $c > 0$ such that for any $ε > 0$ and any integer $m \geq r$ , there exists an in…