Combinatorics Seminar
Weber 117An introduction to topological combinatorics The chromatic number of a graph is the number of vertex colors needed so that adjacent vertices have different colors. In 1955, Kneser made a conjecture about the chromatic number of a certain family of graphs (now called Kneser graphs). This conjecture remained unproven for 23 years until Lovász gave […]