Yan Wang

activity

20152026

most citedA better bound on the size of rainbow matchings

9 citations · 20 across the 24 of their papers we have counts for

collaborators

Showing 2021Show all

4 papers · 1 filter

math.CO2021

Co-degree threshold for rainbow perfect matchings in uniform hypergraphs

Hongliang Lu, Yan Wang, Xingxing Yu

Let $k$ and $n$ be two integers, with $k \geq 3$ , $n \equiv 0 (mod k)$ , and $n$ sufficiently large. We determine the $(k - 1)$ -degree threshold for the existence of a rainbow perfect ma…

math.CO2021

Improved bound for Hadwiger's conjecture

Yan Wang

Hadwiger conjectured in 1943 that for every integer $t \geq 1$ , every graph with no $K_{t}$ minor is $(t - 1)$ -colorable. Kostochka, and independently Thomason, proved every graph with…

math.CO2021

Balanced subdivisions of a large clique in graphs with high average degree

Yan Wang

In 1984, Thomassen conjectured that for every constant $k \in N$ , there exists $d$ such that every graph with average degree at least $d$ contains a balanced subdivision o…

math.CO2021★ 1 cited

Rainbow perfect matchings for 4-uniform hypergraphs

Hongliang Lu, Yan Wang, Xingxing Yu

Let $n$ be a sufficiently large integer with $n \equiv 0 (mod 4)$ and let $F_{i} \subseteq (4 [ n ])$ where $i \in [n /4]$ . We show that if each vertex of $F_{i}$ is contained in more…