Yaoping Hou

collaborators

2 papers

math.CO2026

A lifting theorem for generalized TurÃ¡n numbers of triangles

Junjie Wang, Yaoping Hou

For graphs $H$ and $F$ , the generalized TurÃ¡n number $ex (n, H, F)$ denotes the maximum number of copies of $H$ in an $n$ -vertex $F$ -free graph. We prove a general lif…

math.CO2026

The maximum number of edges in $C_{2 k + 1}^{-}$ -free unbalanced signed graphs with bounded clique number

Junjie Wang, Yaoping Hou

Recently, the TurÃ¡n problem for graphs with bounded clique number has attracted considerable attention. Since a graph can be regarded as a signed graph without negative edges, it…

A lifting theorem for generalized TurÃ¡n numbers of triangles

The maximum number of edges in C2k+1−​-free unbalanced signed graphs with bounded clique number

The maximum number of edges in $C_{2 k + 1}^{-}$ -free unbalanced signed graphs with bounded clique number