(New page: 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 ma...) |
(Brief Outline) |
||
Line 1: | Line 1: | ||
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? | 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? | ||
+ | <br> | ||
− | [[2014 Spring MA 375 Walther|Back to MA375 Spring 2014]] | + | <u></u><u>Outline</u> |
+ | |||
+ | <u></u>Example 1: Square | ||
+ | |||
+ | <br> | ||
+ | |||
+ | Definitions: | ||
+ | |||
+ | *Burnside | ||
+ | *Polya | ||
+ | |||
+ | <br> | ||
+ | |||
+ | Formula: | ||
+ | |||
+ | *show formula | ||
+ | *breakdown of each element | ||
+ | *relate back to example 1 | ||
+ | |||
+ | <br> | ||
+ | |||
+ | link to proof | ||
+ | |||
+ | <br> | ||
+ | |||
+ | References and Additional Information | ||
+ | |||
+ | <br> [[2014 Spring MA 375 Walther|Back to MA375 Spring 2014]] | ||
[[Category:MA375Spring2014Walther]] [[Category:Math]] [[Category:Project]] | [[Category:MA375Spring2014Walther]] [[Category:Math]] [[Category:Project]] |
Revision as of 11:12, 20 April 2014
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