Wanting Sun

collaborators

5 papers

math.CO2026

Transversal Structures in Graph Systems: A Survey

Wanting Sun, Guanghui Wang, Lan Wei

Given a system $G = {G_{1}, G_{2}, \dots, G_{m}}$ of graphs/digraphs/hypergraphs on the common vertex set $V$ of size $n$ , an $m$ -edge graph/digraph/hypergraph $H$ on $V$ is tran…

math.CO2026

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…

math.CO2026

Infinitely many accumulation points of codegree TurÃ¡n densities

Heng Li, Weichan Liu, Bjarne SchÃ¼lke +1

The codegree TurÃ¡n density $I^^{3} (F)$ of a $k$ -graph $F$ is the smallest $I^^{3} \in [0, 1)$ such that every $k$ -graph $H$ with $I^´_{k - 1} (H) \geq (I^^{3} + o (1)) ∣ V (H) ∣$ contains a copy of…

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…