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 math.COShow all

9 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 $…

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…

math.CO2023

Rainbow Hamilton cycle in hypergraph system

Yucong Tang, Bin Wang, Guanghui Wang +1

In this paper, we develop a new rainbow Hamilton framework, which is of independent interest, settling the problem proposed by Gupta, Hamann, Müyesser, Parczyk, and Sgueglia when $…

math.CO2021

Transversal Hamilton cycle in hypergraph systems

Yangyang Cheng, Jie Han, Bin Wang +2

A $k$ -graph system $H = {H_{i}}_{i \in [m]}$ is a family of not necessarily distinct $k$ -graphs on the same $n$ -vertex set $V$ and a $k$ -graph $H$ on $V$ is said to be $\textb…

math.CO2021★ 2 cited

Rainbow spanning structures in graph and hypergraph systems

Yangyang Cheng, Jie Han, Bin Wang +1

We study the following rainbow version of subgraph containment problems in a family of (hyper)graphs, which generalizes the classical subgraph containment problems in a single host…

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

Perturbation of dense graphs

Rainbow Hamilton cycle in hypergraph system

Transversal Hamilton cycle in hypergraph systems

Rainbow spanning structures in graph and hypergraph systems

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