Proof without words of the two-color case of Ramsey’s theorem. (Credit: CMG Lee, Wikimedia) Generally when assuming a chaotic (i.e. random) system like an undirected graph, we assume that if we start coloring these (i.e. assign values) with two colors no real pattern emerges. Yet it’s been proven that if you have a graph with […]