Daniel Discrete Mathematics Exam Prep: Graph Theory Basics (Paths, Cycles, Connectivity)

Описание: In this lesson we start the final revision block for the TUM Discrete Structures exam (15 February).

This session introduces Graph Theory from first principles, treating graphs as relations and building all essential concepts step by step — exactly as required in TUM exams.

What we cover in this lesson:

Graphs as sets + relations

Directed vs undirected graphs

Simple graphs and common exam assumptions

Adjacency matrices and how to read them

Walks, paths, and cycles (with precise definitions)

Connected components and strong connectivity


All definitions are stated explicitly, typical exam traps are highlighted, and examples are worked carefully to ensure full clarity.

Who this lesson is for:

Students preparing for TUM Discrete Structures (INHN0004)

Anyone revising Graph Theory for exams

Students who want clear definitions, not hand-waving


How this fits into the exam plan:

This is Lesson 1 of the final revision cycle, covering the last two syllabus blocks:

1. Graph Theory


2. Number Theory & Groups



We follow a strict schedule:

2 × 90-minute lessons per week

Full theory + worked problems + MCQs

Exam-focused pacing


📌 Next lesson: Eulerian & Hamiltonian graphs, degree conditions, and classic counterexamples.


---

Suggested tags (you can paste directly):

discrete mathematics
graph theory
tum discrete structures
exam preparation
adjacency matrix
connected components
paths and cycles
computer science mathematics


---

🔥
Just say the word.