Join of graphs 2026-09-24
The join is obtained from the disjoint union of graphs by adding every edge between a vertex of and a vertex of .
If is a nontrivial disjoint union of graphs, no defining relation mixes the two vertex sets, and hence
On the topological side, every clique lies in one component, so
a one-point union of Salvetti complexes.
If is a nontrivial join of graphs, every generator from the first part commutes with every generator from the second. Therefore
Every clique of the join is the union of a clique in each factor, which gives the cubical identity