Each Weekly Challenge (WC) invites you to critically engage with the topics covered up to that week. They may take on a variety of formats and be available and attempted through diverse platforms as the semester progresses. They may be attempted individually or in teams as indicated.
This WC presents a puzzle that has to be modeled as a matching in a bipartite graph.
To attempt and submit the task you will need
- to follow given rules to solve a puzzle
- apply the definitions of bipartite graphs and matching in order to model a situation
- to recall previously covered proof techniques in order to select and apply one for a given task
- the time, patience, and perseverance to work through the problem
- the willingness to work through the LaTeX source
- comfort with GitHub and LaTeX
Grading is as per the rubric shared on Canvas.
The task for this WC is explained in the accompanying prompt which is to be compiled in LaTeX. You will enter your solution in the indicated space in the same file.
The deadline is mentioned on Canvas.
For discussion on the WC, please use the related Canvas discussion thread.
viel Spass!