Combinatorics and Graph Theory · Problem 6.2.3

Pólya–Redfield Counting — David Guichard

Mathematics — Combinatorics · burnsides-theorem

Problem

Write the 12 permutations of the edges of the regular tetrahedron corresponding to the 12 rigid motions of the regular tetrahedron in cycle form. Use the labeling below. (regular tetrahedron with edges labeled a,b,c,d,e,f)\text{(regular tetrahedron with edges labeled } a, b, c, d, e, f\text{)}

Related theory

Browse the problem library