Jiang Zhou

most citedA combinatorial problem related to the classical probability

1 citations · 1 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2026

Spectral bounds for distance coloring and packing parameters of graphs via semidefinite programming

Aida Abiad, Yue Yang, Jiang Zhou

Using methods from spectral graph theory and semidefinite programming, we obtain sharp spectral bounds for several graph parameters related to distance colorings and packing, inclu…

math.CO2024

Unified bounds for the independence number of graph powers

Aida Abiad, Jiang Zhou

For a graph $G$ , its $k$ -th power $G^{k}$ is constructed by placing an edge between two vertices if they are within distance $k$ of each other. The $k$ -independence number $α_{k} (G)$ i…

math.CO2024★ 1 cited

A combinatorial problem related to the classical probability

Jiang Zhou

In the classical probability model, let $f (n)$ be the maximum number of pairwise independent events for the sample space with $n$ sample points. The determination of $f (n)$ is equi…