Combinatorics and Graph Theory · Problem 6.3.2

Pólya–Redfield Counting — David Guichard

Mathematics — Combinatorics · polya-redfield-counting

Problem

Using the previous exercise, write out a full inventory of colorings of the vertices of a regular tetrahedron induced by the rigid motions, with three colors, as in example 6.3.5. You may use Sage or some other computer algebra system.

Browse the problem library