Jie Han

activity

20122023

most citedMinimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs

36 citations · 224 across the 54 of their papers we have counts for

collaborators

Showing 2021Show all

9 papers · 1 filter

cs.IT2021

Structural Entropy of the Stochastic Block Models

Jie Han, Tao Guo, Qiaoqiao Zhou +3

With the rapid expansion of graphs and networks and the growing magnitude of data from all areas of science, effective treatment and compression schemes of context-dependent data i…

math.CO2021

Embedding clique-factors in graphs with low $ℓ$ -independence number

Fan Chang, Jie Han, Jaehoon Kim +2

The following question was proposed by Nenadov and Pehova and reiterated by Knierim and Su: Given integers $ℓ, r$ and $n$ with $n \in r N$ , is it true that every $n$ -verte…

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

Transversal Hamilton cycle in hypergraph systems

Yangyang Cheng, Jie Han, Bin Wang +2

A $k$ -graph system $H = {H_{i}}_{i \in [m]}$ is a family of not necessarily distinct $k$ -graphs on the same $n$ -vertex set $V$ and a $k$ -graph $H$ on $V$ is said to be $\textb…

math.CO2021

Large $Y_{k, b}$ -tilings and Hamilton $ℓ$ -cycles in $k$ -uniform hypergraphs

Luyining Gan, Jie Han, Lin Sun +1

Let $Y_{3, 2}$ be the $3$ -uniform hypergraph with two edges intersecting in two vertices. Our main result is that any $n$ -vertex 3-uniform hypergraph with at least $\binom{n}{3} - \…

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.CO2021

Matching of given sizes in hypergraphs

Yulin Chang, Huifen Ge, Jie Han +1

For all integers $k, d$ such that $k \geq 3$ and $k /2 \leq d \leq k - 1$ , let $n$ be a sufficiently large integer {\rm(}which may not be divisible by $k$ {\rm)} and let $s\le \lfloor n/…

math.CO2021

A Ramsey-Turán theory for tilings in graphs

Jie Han, Patrick Morris, Guanghui Wang +1

For a $k$ -vertex graph $F$ and an $n$ -vertex graph $G$ , an $F$ -tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$ . For $r \in N$ , the $r$ -independence nu…

math.CO2021★ 2 cited

Rainbow spanning structures in graph and hypergraph systems

Yangyang Cheng, Jie Han, Bin Wang +1

We study the following rainbow version of subgraph containment problems in a family of (hyper)graphs, which generalizes the classical subgraph containment problems in a single host…

Structural Entropy of the Stochastic Block Models

Embedding clique-factors in graphs with low ℓ-independence number

Tiling multipartite hypergraphs in Quasi-random Hypergraphs

Transversal Hamilton cycle in hypergraph systems

Large Yk,b​-tilings and Hamilton ℓ-cycles in k-uniform hypergraphs

F-factors in Quasi-random Hypergraphs

Matching of given sizes in hypergraphs

A Ramsey-Turán theory for tilings in graphs

Rainbow spanning structures in graph and hypergraph systems

Embedding clique-factors in graphs with low $ℓ$ -independence number

Large $Y_{k, b}$ -tilings and Hamilton $ℓ$ -cycles in $k$ -uniform hypergraphs

$F$ -factors in Quasi-random Hypergraphs