Anyao Wang

most citedThe Turán number for the edge blow-up of trees

1 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2020★ 1 cited

The Turán number for the edge blow-up of trees

Anyao Wang, Xinmin Hou, Boyuan Liu +1

The edge blow-up of a graph $F$ is the graph obtained from replacing each edge in $F$ by a clique of the same size where the new vertices of the cliques are all different. In this…

math.CO2020★ 1 cited

Maximizing the number of independent sets of fixed size in $K_{n}$ -covered graphs

Anyao Wang, Xinmin Hou, Boyuan Liu +1

A graph $G$ is $H$ -covered by some given graph $H$ if each vertex in $G$ is contained in a copy of $H$ . In this note, we give the maximum number of independent sets of size $t\ge 3…

The Turán number for the edge blow-up of trees

Maximizing the number of independent sets of fixed size in Kn​-covered graphs

Maximizing the number of independent sets of fixed size in $K_{n}$ -covered graphs