Xiaofan Yuan

activity

20162020

most citedNear perfect matchings in uniform hypergraphs

2 citations · 3 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2020

Rainbow matchings for 3-uniform hypergraphs

Hongliang Lu, Xingxing Yu, Xiaofan Yuan

Kühn, Osthus, and Treglown and, independently, Khan proved that if $H$ is a $3$ -uniform hypergraph with $n$ vertices such that $n \in 3 Z$ and large, and $δ_1(H)>{n-1\choose…

math.CO2020

4-Separations in Hajós Graphs

Qiqin Xie, Shijie Xie, Xiaofan Yuan +1

As a natural extension of the Four Color Theorem, Hajós conjectured that graphs containing no $K_{5}$ -subdivision are 4-colorable. Any possible counterexample to this conjecture with…

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…

math.CO2016★ 1 cited

Some extremal results on complete degenerate hypergraphs

Jie Ma, Xiaofan Yuan, Mingwei Zhang

Let $K_{s_{1}, s_{2}, \dots, s_{r}}^{(r)}$ be the complete $r$ -partite $r$ -uniform hypergraph and $e x (n, K_{s_{1}, s_{2}, \dots, s_{r}}^{(r)})$ be the maximum number of edges in any $n$ -vertex $K^{…