Wei Wei

collaborators

2 papers

math.CO2023

Matching extension and matching exclusion via the size or the spectral radius of graphs

Shujing Miao, Shuchao Li, Wei Wei

A graph $G$ is said to be $k$ -extendable if every matching of size $k$ in $G$ can be extended to a perfect matching of $G$ , where $k$ is a positive integer. We say $G$ is $1$ -exclu…

math.CO2022

Extensions on spectral extrema of $C_{5} / C_{6}$ -free graphs with given size

Shuchao Li, Wanting Sun, Wei Wei

Let $F$ denote a set of graphs. A graph $G$ is said to be $F$ -free if it does not contain any element of $F$ as a subgraph. The Turán number is the ma…

Matching extension and matching exclusion via the size or the spectral radius of graphs

Extensions on spectral extrema of C5​/C6​-free graphs with given size

Extensions on spectral extrema of $C_{5} / C_{6}$ -free graphs with given size