Yaojun Chen

activity

20182022

most citedThe maximum number of triangles in

F_{k}

-free graphs

3 citations · 5 across the 7 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

math.CO2022★ 3 cited

The maximum number of triangles in $F_{k}$ -free graphs

Xiutao Zhu, Yaojun Chen, Dániel Gerbner +2

The generalized Turán number $e x (n, K_{s}, H)$ is the maximum number of complete graph $K_{s}$ in an $H$ -free graph on $n$ vertices. Let $F_{k}$ be the friendship graph consisting of $k$ t…

math.CO2022

Connectivity of friends-and-strangers graphs on random pairs

Lanchao Wang, Yaojun Chen

Consider two graphs $X$ and $Y$ , each with $n$ vertices. The friends-and-strangers graph $FS (X, Y)$ of $X$ and $Y$ is a graph with vertex set consisting of all bijections $…

math.CO2022

Turán number for odd-ballooning of trees

Xiutao Zhu, Yaojun Chen

The Turán number $e x (n, H)$ is the maximum number of edges in an $H$ -free graph on $n$ vertices. Let $T$ be any tree. The odd-ballooning of $T$ , denoted by $T_{o}$ , is a graph obtaine…

The maximum number of triangles in Fk​-free graphs

Connectivity of friends-and-strangers graphs on random pairs

Turán number for odd-ballooning of trees

The maximum number of triangles in $F_{k}$ -free graphs