Guanghui Wang

activity

20202023

most cited

F

-factors in Quasi-random Hypergraphs

3 citations · 6 across the 18 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

math.CO2022

$H$ -factors in graphs with small independence number

Ming Chen, Jie Han, Guanghui Wang +1

Let $H$ be an $h$ -vertex graph. The vertex arboricity $a r (H)$ of $H$ is the least integer $r$ such that $V (H)$ can be partitioned into $r$ parts and each part induces a forest in $…

math.CO2022

Balanced subdivisions of cliques in graphs

Bingyu Luan, Yantao Tang, Guanghui Wang +1

Given a graph $H$ , a balanced subdivision of $H$ is a graph obtained from $H$ by subdividing every edge the same number of times. In 1984, Thomassen conjectured that for each integ…

math.CO2022★ 1 cited

Clique-factors in graphs with sublinear $ℓ$ -independence number

Jie Han, Ping Hu, Guanghui Wang +1

Given a graph $G$ and an integer $ℓ \geq 2$ , we denote by $α_{ℓ} (G)$ the maximum size of a $K_{ℓ}$ -free subset of vertices in $V (G)$ . A recent question of Nenadov and Pehova…

H-factors in graphs with small independence number

Balanced subdivisions of cliques in graphs

Clique-factors in graphs with sublinear ℓ-independence number

$H$ -factors in graphs with small independence number

Clique-factors in graphs with sublinear $ℓ$ -independence number