Minor-embedding of a non-fully connected graph
The maximum fully-connected graph that can be embedded onto a chimera graph has V nodes, where V = 1+L min(M,N), as explained here. This means that the largest K_v that can be embedded onto the DW2000Q is K65.
How does that change if we want to embed a graph that is not fully connected? How many nodes can we embed onto a DW2000Q if the graph is sparse? In other words, how does the formula V = 1+L min(M,N) change for sparse graphs?