Finite Bipartite Graphs as Induced Subgraphs of Subfactor Principal Graphs
Every finite bipartite simple graph occurs as a vertex-induced unrooted subgraph of the principal graph of an irreducible finite-depth inclusion of hyperfinite type II1 factors. For part sizes m and n, an explicit neighborhood-multiplicity parameter q gives index q3^n, with q at most m+1, and depth at most four. The se...