3 citations · 3 across the 5 of their papers we have counts for
5 papers
Induced even cycles in locally sparse graphs
Laihao Ding, Jun Gao, Hong Liu +2
A graph is -sparse if for every pair of vertex subsets with , . In this paper we prove that for every and…
On the -problem of Brown, Erdős and Sós for
Stefan Glock, Jaehoon Kim, Lyuben Lichev +2
Let denote the maximum number of edges in an -vertex -uniform hypergraph containing no subgraph with edges and at most vertices. Brown, Erdős and Sós…
Tilings in quasi-random -partite hypergraphs
Shumin Sun
Given and two -graphs (-uniform hypergraphs) and , an -factor in is a set of vertex disjoint copies of that together cover the vertex set of . L…
Tiling multipartite hypergraphs in Quasi-random Hypergraphs
Laihao Ding, Jie Han, Shumin Sun +2
Given and two -graphs (-uniform hypergraphs) and , an \emph{-factor} in is a set of vertex disjoint copies of that together covers the vertex set o…
-factors in Quasi-random Hypergraphs
Laihao Ding, Jie Han, Shumin Sun +2
Given and two -graphs (-uniform hypergraphs) and , an -factor in is a set of vertex-disjoint copies of that together covers the vertex set of .…