Revision as of 09:15, 30 January 2014 by Walther (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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?


Back to MA375 Spring 2014

Retrieved from "https://www.projectrhea.org/rhea/index.php?title=Walther375Spring2014_Coloring_regular_polygons:_the_theorems_of_Burnside_and_Polya&oldid=61890"
Shortcuts
Help Main Wiki Page Random Page Special Pages Log in
Search

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood