Connectedness of Certain Graph Coloring Complexes

Publication date 12 February 2017

Abstract: In this article, we consider the bipartite graphs

K_{2} i m e s K_{n}

. We prove that the connectedness of the complex

d i s p l a y s t y l e e x t H o m (K_{2} i m e s K_{n}, K_{m})

is

m - n - 1

if

m g e q n

and

m - 3

in the other cases. Therefore, we show that for this class of graphs,

e x t H o m (G, K_{m})

is exactly

m - d - 2

connected,

m g e q n

, where

d

is the maximal degree of the graph

G

.

This page was built for publication: Connectedness of Certain Graph Coloring Complexes