You must be logged in and verified to contact the designer.
Product Description
This is a pair of earrings highlighting the complete graph with five vertices (K_5). Notice that each of the five corners has a path to every other corner. While K_5 is known to be a nonplanar graph, these earrings are elegant noncrossing three-dimensional embeddings.
Together with the complete bipartite graph K_{3,3}, they form a set of forbidden subgraphs to determine when a graph can be drawn on paper without crossings. This is known as Kuratowski's Theorem.
You may prefer a pair of these two Forbidden Subgraph Earrings.