Mathchings on Graphs -- Axel Ivan Saenz-Rodriguez
<p>
Suppose we are given a graph and are asked to find in it as many 
independent edges as possible. How should we go about this? Will we be 
able to pair up all its vertices in this way? If not, how can we be sure 
that this is indeed possible? Somewhat surprisingly, this basic problem 
does not only lie at the heart of numerous applications, it also gives 
rise to some rather interesting graph theory.
</p>