Jie Han

activity

20142023

most citedSemantic Compression with Side Information: A Rate-Distortion Perspective

8 citations · 8 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2023

Spanning trees in graphs without large bipartite holes

Jie Han, Jie Hu, Lidan Ping +3

We show that for any $ε > 0$ and $Δ \in N$ , there exists $α > 0$ such that for sufficiently large $n$ , every $n$ -vertex graph $G$ satisfying that $δ(G)\geq\varepsilon…

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

Minimum codegree threshold for Hamilton l-cycles in k-uniform hypergraphs

Jie Han, Yi Zhao

For $1 \leq ℓ < k /2$ , we show that for sufficiently large $n$ , every $k$ -uniform hypergraph on $n$ vertices with minimum codegree at least $\frac{n}{2 ( k - ℓ )}$ contains a Hamilton…

Spanning trees in graphs without large bipartite holes

H-factors in graphs with small independence number

Minimum codegree threshold for Hamilton l-cycles in k-uniform hypergraphs

$H$ -factors in graphs with small independence number