Yan Wang

collaborators

3 papers

math.CO2025

Vertex degree sums for rainbow matchings in 3-uniform hypergraphs

Haorui Liu, Mei Lu, Yan Wang +1

Let $n \in 3 Z$ be sufficiently large. Zhang, Zhao and Lu proved that if $H$ is a 3-uniform hypergraph with $n$ vertices and no isolated vertices, and if $deg(u)+deg(v) > \…

math.CO2024

Rainbow perfect matchings in 3-partite 3-uniform hypergraphs

Hongliang Lu, Yan Wang

Let $m, n, r, s$ be nonnegative integers such that $n \geq m = 3 r + s$ and $1 \leq s \leq 3$ . Let \[δ(n,r,s)=\left\{\begin{array}{ll} n^2-(n-r)^2 &\text{if}\ s=1 , \\[5pt] n^2-(n-r+1)(n-r-1)…

math.CO2024

Vertex degree sums for perfect matchings in 3-uniform hypergraphs

Yan Wang, Yi Zhang

Let $n \equiv 0 (mod 3)$ and $H_{n, n /3}^{2}$ be the 3-graph of order $n$ , whose vertex set is partitioned into two sets $S$ and $T$ of size $\frac{1}{3} n + 1$ and $\fra…