Guanghui Wang

collaborators

4 papers

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

Phase transitions of the Erdős-Gyárfás function

Xinyu Hu, Qizhong Lin, Xin Lu +1

Given positive integers $p, q$ . For any integer $k \geq 2$ , an edge coloring of the complete $k$ -graph $K_{n}^{(k)}$ is said to be a $(p, q)$ -coloring if every copy of $K_{p}^{(k)}$ receive…

math.CO2024

Anti-Ramsey numbers of loose paths and cycles in uniform hypergraphs

Tong Li, Yucong Tang, Guanghui Wang +1

For a fixed family of $r$ -uniform hypergraphs $F$ , the anti-Ramsey number of $F$ , denoted by $a r (n, r, F)$ , is the minimum number $c$ of colors such th…