Xingxing Yu

activity

20152026

most citedOn the rainbow matching conjecture for 3-uniform hypergraphs

5 citations · 15 across the 25 of their papers we have counts for

collaborators

36 papers

math.CO2026

Strong chromatic index of bipartite graphs

Yanli Hao, Tianchi Yang, Xingxing Yu

An edge-coloring of a graph $G$ is called a strong edge-coloring if all its color classes are induced matchings in $G$ ; the minimum number of colors required for such a coloring, d…

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…

math.CO2021

Approximating TSP walks in subcubic graphs

Michael C. Wigal, Youngho Yoo, Xingxing Yu

We prove that every simple 2-connected subcubic graph on $n$ vertices with $n_{2}$ vertices of degree 2 has a TSP walk of length at most $\frac{5 n + n _{2}}{4} - 1$ , confirming a conjecture…