Laihao Ding

most cited

F

-factors in Quasi-random Hypergraphs

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

collaborators

3 papers

math.CO2021

Tiling multipartite hypergraphs in Quasi-random Hypergraphs

Laihao Ding, Jie Han, Shumin Sun +2

Given $k \geq 2$ and two $k$ -graphs ( $k$ -uniform hypergraphs) $F$ and $H$ , an \emph{ $F$ -factor} in $H$ is a set of vertex disjoint copies of $F$ that together covers the vertex set o…

math.CO2021★ 3 cited

$F$ -factors in Quasi-random Hypergraphs

Laihao Ding, Jie Han, Shumin Sun +2

Given $k \geq 2$ and two $k$ -graphs ( $k$ -uniform hypergraphs) $F$ and $H$ , an $F$ -factor in $H$ is a set of vertex-disjoint copies of $F$ that together covers the vertex set of $H$ .…

math.CO2019

Properly colored short cycles in edge-colored graphs

Laihao Ding, Jie Hu, Guanghui Wang +1

Properly colored cycles in edge-colored graphs are closely related to directed cycles in oriented graphs. As an analogy of the well-known Caccetta-Häggkvist Conjecture, we study th…

Tiling multipartite hypergraphs in Quasi-random Hypergraphs

F-factors in Quasi-random Hypergraphs

Properly colored short cycles in edge-colored graphs

$F$ -factors in Quasi-random Hypergraphs