This paper provides an expository account, from a design-theoretic point of view, of the important result of Ryser that covering of the complete graph \(K_v\) a total of \(\lambda\) times by \(v\) complete subgraphs can only be done in a very limited number of ways.