Wanting Sun

activity

20212025

most citedAdjacency eigenvalues of graphs without short odd cycles

3 citations · 3 across the 11 of their papers we have counts for

collaborators

Showing 2025Show all

6 papers · 1 filter

math.CO2025

Clique factors in random samplings of regular graphs

Wanting Sun, Shunan Wei, Donglei Yang

We show that for any integer $r \geq 2$ , there exists a constant $c > 0$ such that for every sufficiently large integer $n$ , every $((r - 1) n + 1)$ -regular graph $G$ on $r n$ vertices has a…

math.CO2025

A step toward Chen-Lih-Wu conjecture

Yangyang Cheng, Zhenyu Li, Wanting Sun +1

An equitable $k$ -coloring of a graph is a proper $k$ -coloring where the sizes of any two different color classes differ by at most one. In 1973, Meyer conjectured that every connec…

math.CO2025

Subdivision-free graphs with the maximum spectral radius

Wanting Sun, Guanghui Wang, Pingchuan Yang

Given a graph family $H$ , let $SPEX (n, H_{sub})$ denote the set of $n$ -vertex $H$ -subdivision-free graphs with the maximum spectral radius. In t…

math.CO2025

Packing tetrahedrons in edge-weighted graphs

Wanting Sun, Shunan Wei, Donglei Yang

We prove that for all $μ > 0, t \in (0, 1)$ and sufficiently large $n \in 4 N$ , if $G$ is an edge-weighted complete graph on $n$ vertices with a weight function $w: E(G)\rightar…

math.CO2025

Infinitely many accumulation points of codegree Turán densities

Heng Li, Weichan Liu, Bjarne Schülke +1

The codegree Turán density $γ (F)$ of a $k$ -graph $F$ is the smallest $γ \in [0, 1)$ such that every $k$ -graph $H$ with $δ_{k - 1} (H) \geq (γ + o (1)) ∣ V (H) ∣$ contains a copy of $F$ .…

math.CO2025

Transversal Hamilton cycles in digraph collections

Yangyang Cheng, Heng Li, Wanting Sun +1

Given a collection $D = {D_{1}, D_{2}, \dots, D_{m}}$ of digraphs on the common vertex set $V$ , an $m$ -edge digraph $H$ with vertices in $V$ is \textit{transversal} in $\mathcal…