Graphs whose Kronecker covers are bipartite Kneser graphs (Q2659178)

The author investigates graphs whose Kronecker cover are equal to the Kronecker cover of a Kneser graph. The Kronecker cover \(K_2\times K(n,k)\) of a Kneser graph is bipartite and also called a bipartite Kneser graph. It is denoted by \(H(n,k)\). Graphs with isomorphic Kronecker covers need not to be isomorphic but share many common properties in general. Here, the author constructs \(k\) distinct pairwise non-isomorphic graphs that all have \(H(n,k)\) as their Kronecker cover for every \(n, k\) with \(n > 2k\), \(k \geq 1\). He shows that all these graphs have the same chromatic number as the Kneser graph \(K(n,k)\). Furthermore, he studies the automorphism group of these graphs.