The Coloring Mystery

How many colors do you need to color a map so that no two neighboring regions share the same color? This map-coloring problem can be reformulated using graph theory, where regions become vertices and shared borders become edges. Graph coloring has real-world applications in areas such as scheduling, resource allocation, and more.

In this workshop, we will explore how many colors are needed to color different maps without neighboring regions sharing the same color. You will discover the fascinating history behind its proof, learn key algorithms, and explore connections to graph theory. In the final activity, we will apply graph coloring to solve complex scheduling problems inspired by real-life situations.

Why participate?

• You will learn about
  • One of the prominent problems in mathematics
  • The fascinating history behind its proof
  • Some fundamental concepts of graph theory
• The workshop develops, teaches
  • Problem-solving skills
  • Logical and algorithmic thinking
  • Getting a feeling for mathematical proofs
• Applicable in multiple ways especially in our modern world
• Developing interest in math
• Overcoming math anxiety
• Gain confidence in mathematics
• Connect people with similar interest
• Have fun J

 

When?

13 September 2025, 10:00-13:00

 

To whom?

Childred aged between 11 and 15.
No previous mathematical knowledge is required.

 

Where?

Familienzentrum Flüügepilz
Schulhausstrasse 40
8703 Erlenbach ZH

 

Costs

90 CHF/workshop/person
80 CHF for members of Familienclub Erlenbach

 

Hope to see you soon!
With any questions do not hesitate to contact us!

 

Registration is required and can be done via Email, WhatsApp, or here: