The Mycielski Construction: A Brief Overview and Proof

More on The Mycielski Construction/Mycielskian: https://en.wikipedia.org/wiki/Mycielskian Credits: 3blue1brown for the python library manim, which was used to create the animations Georgia Tech MATH4022 "Intro To Graph Theory". The proof was adapted from lecture. The example (C_5), was the one used on the wikipedia page for the Mycielski Construction. Chapters: 0:00 Introduction 0:26 C5 - The cycle on 5 vertices 0:45 Mycielskian of C5 1:37 Multiple Mycielskians of C5 1:55 G is triangle free then M(G) is triangle free 3:36 The chromatic number of M(G) is greater than the chromatic number of G 4:51 Outro