Bin Wang

activity

20212026

most citedRainbow spanning structures in graph and hypergraph systems

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

collaborators

Showing 2026Show all

5 papers · 1 filter

math.CO2026

Perfect Matching in $k$ -Partite $k$ -Uniform Hypergraphs

Jie Han, Hongliang Lu, Bin Wang +1

A balanced $k$ -partite $k$ -graph is a $k$ -uniform hypergraph whose vertex set is partitioned into $k$ classes of the same size and whose edges meet every class in exactly one verte…

math.CO2026

Exact Minimum $d$ -Degree Thresholds for Hypergraph Perfect Matchings

Jie Han, Hongliang Lu, Bin Wang +1

For fixed integers $k \geq 3$ and $1 \leq d \leq k - 1$ and sufficiently large $n \in k N$ , we establish the sharp minimum $d$ -degree thresholds that forces perfect matching in every…

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.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 $Δ > 0$ there exists $η > 0$ such that the following holds: Let $G$ be an $n$ -vertex graph with at least $Ω (n^{2})$ edges and let $H$ be an $n$ -vertex $…

Perfect Matching in k-Partite k-Uniform Hypergraphs

Exact Minimum d-Degree Thresholds for Hypergraph Perfect Matchings

On the number of factorable induced subgraphs

Decision problem for Hamilton 2-cycles in 4-graphs

The perturbation threshold of degenerate graphs

Perfect Matching in $k$ -Partite $k$ -Uniform Hypergraphs

Exact Minimum $d$ -Degree Thresholds for Hypergraph Perfect Matchings

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