Yan Wang

collaborators

3 papers

math.CO2017

Minimum co-degree condition for perfect matchings in k-partite k-graphs

Hongliang Lu, Yan Wang, Xingxing Yu

Let $H$ be a $k$ -partite $k$ -graph with $n$ vertices in each partition class, and let $δ_{k - 1} (H)$ denote the minimum co-degree of $H$ . We characterize those $H$ with $δ_{k-1}(H) \…

math.CO2016

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…

Minimum co-degree condition for 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 II: 2-vertices in $K_{4}^{-}$