Don’t let the title mislead you, coloring isn’t kid’s stuff. Coloring of graphs is a rich mathematical area of research which young mathematicians will encounter frequently.
Mr. Maier is going to talk about coloring arguments and some of their applications to combinatorial problems, especially problems from the theory of plane tilings, but also from knot theory, probability, and some popular puzzles. Is it possible to cover an eight-by-eight inch chessboard with two-by-one inch dominos? Is it possible to cover the remainder with dominos? If so, how, and if not, why not?
If you’d like to learn more about coloring the following links may be useful: