In this chapter, we start with the complete graph on six vertices, \(K_6\) and begin to construct three diverse and remarkable combinatorial structures. This material follows Chapter 6, “A property of the number six” of “Designs, Graphs, Codes and their Links” by P.J. Cameron and J.H. van Lint, who in turn credit lectures of G. Higman. We begin with the vertices and edges of the complete graph, and then create sets of three disjoint edges known as \(1\)-factors. Collections of \(1\)-factors become factorizations of the original complete graph. Vertices, edges, factors and factorizations then all combine in Chapter 6 to create our three ultimate combinatorial structures.