Jie Han

activity

20142024

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

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

collaborators

5 papers

math.CO2023

On powers of Hamilton cycles in Ramsey-Turán Theory

Ming Chen, Jie Han, Yantao Tang +1

We prove that for $r \in N$ with $r \geq 2$ and $μ > 0$ , there exist $α > 0$ and $n_{0}$ such that for every $n \geq n_{0}$ , every $n$ -vertex graph $G$ with $δ(G)\geq \left(1-\fr…

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…

cs.IT2022★ 8 cited

Semantic Compression with Side Information: A Rate-Distortion Perspective

Tao Guo, Yizhu Wang, Jie Han +3

We consider the semantic rate-distortion problem motivated by task-oriented video compression. The semantic information corresponding to the task, which is not observable to the en…

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…

On powers of Hamilton cycles in Ramsey-Turán Theory

Spanning trees in graphs without large bipartite holes

Semantic Compression with Side Information: A Rate-Distortion Perspective

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