Quartz 4

Home

❯

Discrete Mathematics MOC

Discrete Mathematics MOC

Feb 01, 20261 min read

  • uni/DisMat

Vorlesungen

  • DisMat VL 14-10-2025

  • DisMat VL 16-10-2025

  • DisMat VL 21-10-2025

  • DisMat VL 30-10-2025

  • DisMat VL 04-11-2025

  • DisMat VL 06-11-2025

  • DisMat VL 11-11-2025

  • DisMat VL 13-11-2025

  • DisMat VL 18-11-2025

  • DisMat VL 20-11-2025

  • DisMat VL 02-12-2025

  • DisMat VL 04-12-2025

  • DisMat VL 09-12-2025

  • DisMat VL 16-12-2025

  • DisMat VL 18-12-2025

  • DisMat VL 13-01-2026

  • DisMat VL 15-01-2026

  • DisMat VL 20-01-2026

  • DisMat VL 27-01-2026

Parts:

  1. Enumarative combinatorics ⇒ How many?

  2. Structures incl. Graphs

  3. Extremal combinatorics ⇒ extremal examples

  4. Algebraic enumaration (Not for CS) ⇒ Per group, group actions

Enumarative combinatorics
Generating Functions
Graph
Uniform Matroids
Graph coloring
Euler characteristic

Exercises:

DisMat UE 01
DisMat UE 02
DisMat UE 03
DisMat UE 04
DisMat UE 05
DisMat UE 06
DisMat UE 07
DisMat UE 08
DisMat Bonus
DisMat UE 09
DisMat UE 10

Noten

Discrete Mathe Noten

Exam

Dis Mat Exam Topics
DisMat Lernzettel

Themen die ich nochmal verstehen muss:

  • Tripple counting
  • multinomial coeffcients
  • Stirling Numbers & Bell numbers
  • Inklusion-Exklusion
  • Catalan Numbers
  • Axiom of Choice
  • de Bruijn sequence
  • Chromatic Polynomial
  • Binominalkoeffizenten

Graph View

  • Vorlesungen
  • Exercises:
  • Noten
  • Exam
  • Themen die ich nochmal verstehen muss:

Backlinks

  • Algorithmus von Kruskal
  • Algorithmus von Prim
  • Binomischer Lehrsatz
  • Bäume und Wälder
  • Flow Augmenting Paths
  • Graph coloring
  • Hamilton Kreis
  • Hierholzer Algrithmus
  • Inklusion-Exklusion
  • Matroids
  • Max Flow Problem
  • Max-Flow Min-Cut Theorem
  • Minimal Spanning Tree
  • Satz von Euler
  • Uniform Matroids
  • index
  • s-t-Cut

Created with Quartz v4.5.1 © 2026

  • GitHub
  • Discord Community