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

4 papers · 1 filter

math.CO2023

A class of trees determined by their chromatic symmetric functions

Yuzhenni Wang, Xingxing Yu, Xiao-Dong Zhang

Stanley introduced the concept of chromatic symmetric functions of graphs which extends and refines the notion of chromatic polynomials of graphs, and asked whether trees are deter…

math.CO2023★ 1 cited

Planar Turán number of the 7-cycle

Ruilin Shi, Zach Walsh, Xingxing Yu

The $planar Tur a ˊ n number$ $ex_{P} (n, H)$ of a graph $H$ is the maximum number of edges in an $n$ -vertex planar graph without $H$ as a subgraph. Let $C_{\e…

math.CO2023

Linkages and removable paths avoiding vertices

Xiying Du, Yanjia Li, Shijie Xie +1

We say that a graph $G$ is $(2, m)$ -linked if, for any distinct vertices $a_{1}, \dots, a_{m}, b_{1}, b_{2}$ in $G$ , there exist vertex disjoint connected subgraphs $A, B$ of $G$ such that $\…

math.CO2023

On stability of rainbow matchings

Hongliang Lu, Yan Wang, Xingxing Yu

We show that for any integer $k \geq 1$ there exists an integer $t_{0} (k)$ such that for integers $t, k_{1}, \dots, k_{t + 1}, n$ with $t > t_{0} (k)$ , $max {k_{1}, \dots, k_{t + 1}} \leq k$ , and…