In graph theory, the Petersen family is a set of seven undirected graphs that includes the Petersen graph and the complete graph . The Petersen family is named after Danish mathematician Julius Petersen, the namesake of the Petersen graph. Any of the graphs in the Petersen family can be transformed into any other graph in the family by Δ-Y or Y-Δ transforms, operations in which a triangle is replaced by a degree-three vertex or vice versa. These seven graphs form the forbidden minors for linklessly embeddable graphs, graphs that can be embedded into three-dimensional space in such a way that no two cycles in the graph are linked. They are also among the forbidden minors for the YΔY-reducible graphs. Definition The form of Δ-Y and Y-Δ transforms used to define the Petersen family is as follows: If a graph contains a vertex with exactly three neighbors, then the Y-Δ transform of at is the graph formed by removing from and adding edges between each pair of its three neighbors. If a graph contains a triangle , then the Δ-Y transform of at is the graph formed by removing edges , , and from and adding a new vertex connected to all three of , , and . These transformations are so called because of the Δ shape of a triangle in a graph and the Y shape of a degree-three vertex. Although these operations can in principle lead to multigraphs, that does not happen within the Petersen family. Because these operations preserve the number of edges in a graph, there are only finitely many graphs or multigraphs that can be formed from a single starting graph by combinations of Δ-Y and Y-Δ transforms. The Petersen family then consists of every graph that can be reached from the Petersen graph by a combination of Δ-Y and Y-Δ transforms. There are seven graphs in the family, including the complete graph on six vertices, the eight-vertex graph formed by removing a single edge from the complete bipartite graph , and the seven-vertex complete tripartite graph . Forbidden minors A minor of a graph G is another graph formed from G by contracting and removing edges. As the Robertson–Seymour theorem shows, many important families of graphs can be characterized by a finite set of forbidden minors: for instance, according to Wagner's theorem, the planar graphs are exactly the graphs that have neither the complete