Jie Han

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

Tight Hamiltonian Cycles in Uniformly Dense $3$ -Graphs

Yaobin Chen, Jie Han, Xizhi Liu

We study minimum degree conditions for tight Hamiltonian cycles in uniformly dense $3$ -uniform hypergraphs. We prove that for every $d, α > 0$ , every sufficiently large $(ρ, d)$ -dense…

math.CO2026

On the number of factorable induced subgraphs

Jie Han, Bin Wang, Jingwen Zhao

Let $F$ be an $r$ -vertex graph. In this paper, we study the $F$ -factor problem in random induced subgraphs of dense graphs. We show that for any $r$ -vertex graph $F$ and $γ > 0$ , if…

math.CO2025

Robustness for expander graphs

Yaobin Chen, Yu Chen, Jie Han +1

We study robust versions of properties of $(n, d, λ)$ -graphs, namely, the property of a random sparsification of an $(n, d, λ)$ -graph, where each edge is retained with probability $p$ …

math.CO2025

Perturbation of dense graphs

Jie Han, Seonghyuk Im, Bin Wang +1

In the past two decades, various properties of randomly perturbed/augmented (hyper)graphs have been intensively studied, since the model was introduced by Bohman, Frieze and Martin…

Tight Hamiltonian Cycles in Uniformly Dense 3-Graphs

On the number of factorable induced subgraphs

Robustness for expander graphs

Perturbation of dense graphs

Tight Hamiltonian Cycles in Uniformly Dense $3$ -Graphs