Jie You

activity

20152026

most citedApproximate Association via Dissociation

15 citations · 17 across the 6 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

math.CO2023

Minimum $ℓ$ -degree thresholds for rainbow perfect matching in $k$ -uniform hypergraphs

Jie You

Given $n \in k N$ elements set $V$ and $k$ -uniform hypergraphs $H_{1}, \dots, H_{n / k}$ on $V$ . A rainbow perfect matching is a collection of pairwise disjoi…

math.CO2023

Minimum degree thresholds for Hamilton $(ℓ, k - ℓ)$ -cycles in $k$ -uniform hypergraphs

Jian Wang, Jie You

Let $n > k > ℓ$ be positive integers. We say a $k$ -uniform hypergraph $H$ contains a Hamilton $(ℓ, k - ℓ)$ -cycle if there is a partition $(L_0,R_0,L_1,R_1,\ldots,L_{t-1…

Minimum ℓ-degree thresholds for rainbow perfect matching in k-uniform hypergraphs

Minimum degree thresholds for Hamilton (ℓ,k−ℓ)-cycles in k-uniform hypergraphs

Minimum $ℓ$ -degree thresholds for rainbow perfect matching in $k$ -uniform hypergraphs

Minimum degree thresholds for Hamilton $(ℓ, k - ℓ)$ -cycles in $k$ -uniform hypergraphs