-
the probabilistic method is pretty funny
reframing conventionally simple computations with limited models of computation
-
perfect matchings and how most graphs are connected
a taste of the types of results one works with when dealing with expander graphs
-
why gym rats love ford-fulkerson
what most people associate with the passage of water and time; a nightmarish combinatorial optimization problem for those in cs.
-
chebyshev ruins convocations
i spent far too much time looking at normal distributions for this one
-
so i gave a theory talk
the petersen graph is in almost every sense of the word; a universal counter-example