https://madhacks.io/
An introduction to improving performance by observing cache and memory locality, as well as techniques and best practices when doing common tasks in C++. No prior knowledge required although an understanding of pointers is recommended.
What is the chromatic polynomial of the modified complete graph K2n, which lacks the edges (1, 2), (3, 4), …, (2n-1, 2n)?
To understand and solve this problem, we will discuss several topics from Graph Theory and Combinatorics, such as chromatic numbers, chromatic polynomials, and one important and useful counting principle which justifies this whole talk.