Tangled piecewise‐linear embeddings of trivalent graphs

A method is described for generating and exploring tangled piecewise‐linear embeddings of trivalent graphs under the constraints of point‐group symmetry. It is shown that the possible vertex‐transitive tangles are either graphs of vertex‐transitive polyhedra or bipartite vertex‐transitive nonplanar graphs. One tangle is found for 6 vertices, three for 8 vertices (tangled cubes), seven for 10 vertices, and 21 for 12 vertices. Also described are four isogonal embeddings of pairs of cubes and 12 triplets of tangled cubes (16 and 24 vertices, respectively). Vertex 2‐transitive embeddings are obtained for tangled trivalent graphs with 6 vertices (two found) and 8 vertices (45 found). Symmetrical tangles of the 10‐vertex Petersen graph and the 20‐vertex Desargues graph are also described. Extensions to periodic tangles are indicated. These are all interesting and viable targets for molecular synthesis. Embeddings of tangled trivalent graphs, with linear connectors (or `sticks') between vertices, are generated under appropriate point‐group symmetries, and described. These structures present interesting targets for molecular synthesis of tangled molecules.