Xingxing Yu

activity

20152026

most citedA better bound on the size of rainbow matchings

9 citations · 39 across the 35 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019

Monochromatic subgraphs in iterated triangulations

Jie Ma, Tianyun Tang, Xingxing Yu

For integers $n \geq 0$ , an iterated triangulation $T r (n)$ is defined recursively as follows: $T r (0)$ is the plane triangulation on three vertices and, for $n \geq 1$ , $T r (n)$ is the p…

math.CO2019

Wheels in planar graphs and Hajós graphs

Qiqin Xie, Shijie Xie, Xingxing Yu +1

It was conjectured by Hajós that graphs containing no $K_{5}$ -subdivision are 4-colorable. Previous results show that any possible minimum counterexample to Hajós' conjecture, called…

math.CO2019★ 2 cited

Near perfect matchings in uniform hypergraphs

Hongliang Lu, Xingxing Yu, Xiaofan Yuan

In this paper, we study degree conditions for the existence of large matchings in uniform hypergraphs. We prove that for integers $k, l, n$ with $k \geq 3$ , $k /2 < l < k$ , and $n$ large, i…