On the maximum number of non attacking rooks on a high-dimensional simplicial chessboard

Arash Ahadi, Mohsen Mollahajiaghaei, Ali Dehghan

The simplicial rook graph $\mathcal{S}\mathcal{R}(m,n)$ is the graph whose vertices are vectors in ${\mathbb{N}}^m$ such that for each vector the summation of its coordinates is $n$ and…