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 2022Show all

2 papers · 1 filter

math.CO2022

Rainbow clique subdivisions

Yan Wang

We show that for any integer $t \geq 2$ , every properly edge colored $n$ -vertex graph with average degree at least $(lo g n)^{2 + o (1)}$ contains a rainbow subdivision of a complete g…

math.CO2022

Graph Partitions Under Average Degree Constraint

Yan Wang, Hehui Wu

In this paper, we prove that every graph with average degree at least $s + t + 2$ has a vertex partition into two parts, such that one part has average degree at least $s$ , and the oth…