Recent examples in the theory of partition graphs

Abstract A partition graph is an intersection graph for a collection of subsets of auniversal set S with the property that every maximal independent set of vertices corresponds to a partition of S . Two questions which arose in the study of partition graphs are answered by recently discovered examples. An enumeration of the partition graphs on ten or fewer vertices is provided.