Combinatorics 2022/23 – tutorials
This is a tutorial session for the lecture on Combinatorics (NMAG403) taught by Pavel Valtr and Jan Kratochvíl. The language (English/Czech) is yet to be decided. We are meeting on
Wednesdays at
12.20 in
K7. See the
schedule.
- There will be 4 or 5 problem sets, each with a deadline.
- Each problem will be worth 1 point, there will be around 12 problems in total.
- Solutions submitted after the deadline will be worth 1/2 pnt.
- To get the credit ("zápočet"), you need to get 50 % of the total points.
Submitting the solutions
- You can submit the solutions by e-mail to
matej AT kam.mff.cuni.cz
- Make sure that I can open (no absurd formats like docx, please use PDF) and read your solutions.
- You can use any language I will understand.
- The deadline is always before the start of the tutorial (that is, Wed at 12.20)!
Preliminary schedule
5. 10. 2022 | Hall's theorem and basics. Problems. HW set #1 (deadline in two weeks, because the lecture hasn't covered Hall's theorem yet). |
12. 10. 2022 | Hall's theorem & matchings. Problems. |
19. 10. 2022 | Tutte theorem. Problems. Deadline for HW set #1. |
26. 10. 2022 | Edmonds' algorithm. Problems. |
2. 11. 2022 | List colouring. Problems. |
9. 11. 2022 | Dean's sports day, no tutorials. |
16. 11. 2022 | Heawood and Vizing. Problems. HW #2. |
23. 11. 2022 | Hamiltonian graphs. Problems. Deadline for HW set #2. HW #3. |
7. 12. 2022 | Projective planes and BIBD's. Problems. HW #4. Deadline for HW set #3. |
14. 12. 2022 | Graph limits. See recording from two years ago (or maybe rather don't). |
21. 12. 2022 | Deadline for HW set #4. |
Homework results
If you wish to be listed here, send me your permission and a nickname :).
Name |
1.1 |
1.2 |
1.3 |
2.1 |
2.2 |
2.3 |
3.1 |
3.2 |
3.3 |
Sum |
Pál Erdős |
1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
9 |
TatarkaJeNej |
1 | 1 | 1 | 1 | 1 | | 1 | | |
6 |
mym |
1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
9 |
Naposnap |
1 | 1 | 1 | | | | 1 | | |
4 |
EvilArthas |
1 | 1 | 1 | 1 | | 1 | 1 | | |
6 |
CM |
1 | 1 | | 1 | 1 | 1 | 1 | 1 | 1 |
8 |