This construction started from the graph with a single vertex say  and inductively constructed  from  as follows: let  have  vertices, then take a set  of  vertices and for each subset  of  of size  add a disjoint copy of  and join it to  with a matching.
This construction starts with a single vertex and expands it inductively by adding disjoint copies of vertices and matching them to other vertices in the set.