Guichard-Combinatorics-Graph-Theory · Problem 6.2.4

Pólya–Redfield Counting

Mathematics — Probability · burnsides-theorem

Problem

Find the number of different colorings of the edges of a regular tetrahedron with

k

colors, modulo the rigid motions.