We discuss in class colorings of graphs, where adjacent vertices have different colors. Suppose you took the graph to be a polygon and allowed the graph to be reflected and rotated. How many different colorings do you get?
Outline
Example 1: Square
Definitions:
- Burnside
- Polya
Formula:
- show formula
- breakdown of each element
- relate back to example 1
link to proof
References and Additional Information