Explore the concept of 2-universality in random graphs through this comprehensive seminar talk by Gal Kronenberg from Tel Aviv University. Delve into monotone increasing graph properties, age universality, and the determination of probability thresholds. Learn about the key theorem and its proof, including the connecting lemma and expansion properties. Examine examples and problems related to the topic, gaining insights into this fascinating area of discrete mathematics and computer science.
Overview
Syllabus
Intro
monotone increasing graph properties
examples
age
universality
Determining the probability threshold
Theorem
Proof
Connecting lemma
Expansion properties
Example
Problem
Taught by
Institute for Advanced Study
