Cube tiling and covering a complete graph (Q1173697): Difference between revisions

A conjecture on filling \(n\)-space with \(n\)-cubes due to Keller has been reformulated as a conjecture on graphs that states: if \(G_ 1,\dots,G_ n\) are bipartite graphs on \(2^ n\) vertices whose union is the complete graph on \(2^ n\) vertices, then each \(G_ i\) contains an edge \(e_ i\) for which \(G_ j\cup e_ i\) contains an odd cycle for each \(1\leq i\), \(j\leq n\), \(i\neq j\). Here the authors prove a special case in which each \(G_ i\) is the disjoint union of at most two regular complete bipartite subgraphs.