On r-equitable chromatic threshold of Kronecker products of complete graphs

Wei Wang, Zhidan Yan, Xin Zhang

A graph $G$ is $r$-equitably $k$-colorable if its vertex set can be partitioned into $k$ independent sets, any two of which differ in size by at most $r$. The $r$-equitable chromat…