Xingxing Yu

collaborators

2 papers

math.CO2016

The Kelmans-Seymour conjecture IV: a proof

Dawei He, Yan Wang, Xingxing Yu

A well known theorem of Kuratowski in 1932 states that a graph is planar if, and only if, it does not contain a subdivision of $K_{5}$ or $K_{3, 3}$ . Wagner proved in 1937 that if a g…

math.CO2016

On rainbow matchings for hypergraphs

Hongliang Lu, Xingxing Yu

For any posotive integer $m$ , let $[m] := {1, \dots, m}$ . Let $n, k, t$ be positive integers. Aharoni and Howard conjectured that if, for $i \in [t]$ , $\mathcal{F}_i\subset[n]^k:= \{(a…