Guanghui Wang

collaborators

9 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.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…

math.CO2024

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.CO2024

An El-Zahar Type Theorem in $3$ -graphs under Codegree Condition

Yangyang Cheng, Mengjiao Rao, Guanghui Wang +1

A $3$ -uniform loose cycle, denoted by $C_{t}$ , is a $3$ -graph on $t$ vertices whose vertices can be arranged cyclically so that each hyperedge consists of three consecutive vertices,…

math.CO2024

Transversal Hamilton paths and cycles

Yangyang Cheng, Wanting Sun, Guanghui Wang +1

Given a collection $G = {G_{1}, G_{2}, \dots, G_{m}}$ of graphs on the common vertex set $V$ of size $n$ , an $m$ -edge graph $H$ on the same vertex set $V$ is transversal in $\mat…

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…

math.CO2024

Exploring Homological Properties of Independent Complexes of Kneser Graphs

Ziqin Feng, Guanghui Wang

We discuss the topological properties of the independence complex of Kneser graphs, Ind(KG $(n, k))$ , with $n \geq 3$ and $k \geq 1$ . By identifying one kind of maximal simplices thro…

A step toward Chen-Lih-Wu conjecture

Subdivision-free graphs with the maximum spectral radius

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

Transversal Hamilton cycles in digraph collections

Transversal Structures in Graph Systems: A Survey

An El-Zahar Type Theorem in 3-graphs under Codegree Condition

Transversal Hamilton paths and cycles

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

Exploring Homological Properties of Independent Complexes of Kneser Graphs

An El-Zahar Type Theorem in $3$ -graphs under Codegree Condition