I suggest the probabilistic method in combinatorics and graph theory, for a few reasons:
- This will introduce the students to other mathematical concepts that they may not be aware of already, but you can also quickly teach them enough of the basics to apply topics from your probability course to a new problem.
- This is a somewhat surprising application of probability, in the sense that it will be used to non-constructively demonstrate something exists without exhibiting a specific object.
- If you extend the discussion just a little bit, you can bring the students to the edge of current human understanding and pose some open problems. This will hopefully excite them, as I assume they are used to being taught known results and are under the impression that math is somehow "solved".
Specifically, I recommend discussing Ramsey Numbers. The Wikipedia entry for the Probabilistic Method has a good explanation of how this method can provide a lower bound on the Ramsey number $R(r,r)$ (defined as the smallest $n$ such that any 2-coloring of the edges of $K_n$ must yield a $K_r$ subgraph whose edges are all the same color). Specifically, it can be shown that $R(r,r)\geq n+1$ as long as ${n \choose r}2^{{1-{r \choose 2}}}<1$.
That quantity on the left-hand side of the inequality is the expected value of the random variable that counts the number of monochromatic $K_r$ subgraphs in a 2-coloring of $K_n$. Since that random variable only takes on integer values, if that expected value is less than 1, then there must be some instance where the variable takes on the value 0. In such an instance, there are no monochromatic $K_r$ subgraphs, meaning it is possible to avoid having a monochromatic $K_r$ by 2-coloring $K_n$ in a particular way. Thus, $R(r,r)>n$ must be true.
However, this argument does not show at all how to achieve such a coloring! Indeed, this is still a genuinely hard problem, in general. After this presentation, you can share some further facts with the students about Ramsey Numbers, especially how we know $R(3,3)$ and $R(4,4)$ exactly, but even $R(5,5)$ is unknown. (Note: The upper bound on $R(5,5)$ was just improved recently in 2017.)