Colourful theorems and topological lower bounds on chromatic numbers
Claude Tardif · 2011
We introduce the cross-index, which refines the usual topological lower bounds on the chromatic number of a graph. We use the cross-index to prove colourful complete bipartite subgraph theorems in the spirit of [15, 16]. We investigate the complexity of computing the cross-index of Z2-posets.