VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.

401-5006-21L DR D-MATH

Random Graphs

Lecturers: Prof. Dr. Michael Krivelevich
VVZ CR n/a

Last Updated: 2026-02-05 15:54:12

Abstract

Nachdiplom lecture

Content

Random graphs is a generic name for discrete probability spaces, whose ground sets are composed of graphs, or more generally of discrete structures. Since its inception by Erdős and Rényi some sixty years ago, random graphs have grown to be one of the key disciplines in modern Combinatorics, at the same time serving as an indispensable tool for other branches of Combinatorics and Computer Science. The course will serve as an introduction to random graphs, covering classical topics as well as addressing recent developments and tools. Course syllabus (tentative): Models of random graphs and of random graph processes; illustrative examples; random regular graphs, configuration model; small subgraphs; long paths and Hamiltonicity; hitting time results; coloring problems; extremal problems in random graphs; pseudo-​random graphs. Desirable background: Working knowledge of Graph Theory, familiarity with basic notions of Probability and Linear Algebra.

General Information

Language
English
Levels
DR

Examination

Type
no performance assessment

Course Components

Type Title Time & Place Hours
lecture Random Graphs
Time: 14:15 – 16:00
  • Wed 14:00-16:00 (ON LI NE)
2 h weekly

Offered In

  • Doctoral Department of Mathematics (More Information at: The list of courses (together with the allocated credit points) eligible for doctoral students is published each semester in the newsletter of the ZGSM. WARNING: Do not mistake ECTS credits for credit points for doctoral studies!)