Bin Wang

works on

graph factors 1 hypergraph matchings 1 minimum degree conditions 1 probabilistic combinatorics 1 random induced subgraphs 1

From the 2 of 4 linked papers with an AI index.

collaborators

4 papers

math.CO2026

On the number of factorable induced subgraphs

Jie Han, Bin Wang, Jingwen Zhao

The paper studies when random induced subgraphs of dense graphs contain a perfect packing (F‑factor) of a fixed small graph F, showing that under a minimum‑degree condition the pro…

math.CO2026

Decision problem for Hamilton $2$ -cycles in $4$ -graphs

Luyining Gan, Jie Han, Bin Wang

A $4$ -uniform $2$ -cycle in a $4$ -uniform hypergraph of length $t$ is a cyclic ordering of $2 t$ vertices $v_{1} v_{2} \dots v_{2 t} v_{1}$ such that $v_{2 i + 1} v_{2 i + 2} v_{2 i + 3} v_{2 i + 4}$ are ed…

math.CO2026

The perturbation threshold of degenerate graphs

Jie Han, Seonghyuk Im, Bin Wang +1

We show that for any $d \geq 2$ and $I^ > 0$ there exists $I^\cdot > 0$ such that the following holds: Let $G$ be an $n$ -vertex graph with at least $I^c ◯ (n^{2})$ edges and let $H$ be an $n$ -verte…

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…

On the number of factorable induced subgraphs

Decision problem for Hamilton 2-cycles in 4-graphs

The perturbation threshold of degenerate graphs

Perturbation of dense graphs

Decision problem for Hamilton $2$ -cycles in $4$ -graphs