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

6 papers · 1 filter

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…

math.CO2016

The Kelmans-Seymour conjecture III: 3-vertices in $K_{4}^{-}$

Dawei He, Yan Wang, Xingxing Yu

Let $G$ be a 5-connected nonplanar graph and let $x_{1}, x_{2}, y_{1}, y_{2} \in V (G)$ be distinct, such that $G [{x_{1}, x_{2}, y_{1}, y_{2}}] ≅ K_{4}^{-}$ and $y_{1} y_{2} \in / E (G)$ . We show that one of t…

math.CO2016★ 1 cited

Almost perfect matchings in $k$ -partite $k$ -graphs

Hongliang Lu, Yan Wang, Xingxing Yu

The minimum co-degree threshold for a perfect matching in a $k$ -graph with $n$ vertices was determined by Rödl, Ruciński and Szemerédi for the case when $n \equiv 0 (mod k)$ . Recentl…

math.CO2016★ 2 cited

Induced Forests in Bipartite Planar Graphs

Yan Wang, Qiqin Xie, Xingxing Yu

Akiyama and Watanabe conjectured that every simple planar bipartite graph on $n$ vertices contains an induced forest on at least $5 n /8$ vertices. We apply the discharging method to…

math.CO2016

The Kelmans-Seymour conjecture II: 2-vertices in $K_{4}^{-}$

Dawei He, Yan Wang, Xingxing Yu

We use $K_{4}^{-}$ to denote the graph obtained from $K_{4}$ by removing an edge, and use $T K_{5}$ to denote a subdivision of $K_{5}$ . Let $G$ be a 5-connected nonplanar graph and $\{x_1,x_2…

The Kelmans-Seymour conjecture IV: a proof

On rainbow matchings for hypergraphs

The Kelmans-Seymour conjecture III: 3-vertices in K4−​

Almost perfect matchings in k-partite k-graphs

Induced Forests in Bipartite Planar Graphs

The Kelmans-Seymour conjecture II: 2-vertices in K4−​

The Kelmans-Seymour conjecture III: 3-vertices in $K_{4}^{-}$

Almost perfect matchings in $k$ -partite $k$ -graphs

The Kelmans-Seymour conjecture II: 2-vertices in $K_{4}^{-}$