Add link to short handout about extremal graph theory

2024-01-14 18:31:55 -05:00 · 2024-01-14 18:31:55 -05:00 · 493d9a74a1
commit 493d9a74a1
parent 0b5970d483
1 changed files with 4 additions and 0 deletions
--- a/content/posts/extremal-graph-theory.md
+++ b/content/posts/extremal-graph-theory.md
@ -38,3 +38,7 @@ $$\frac{N^2}{4} \geq M$$
 This bound is tight with our earlier result, so we can't do better than a complete bipartite graph with two even halves. And that's it!

 Alek wrote up the same [proof of this theorem on his blog](https://awestover.github.io/skyspace/posts/graphtheory/01-14-24.html) as well. 
+
+## Further reading
+
+- https://www.mit.edu/~shint/handouts/ExtremalGraphTheory.pdf