YoVDO

Universality of Random Graphs - Gal Kronenberg

Offered By: Institute for Advanced Study via YouTube

Tags

Graph Theory Courses Discrete Mathematics Courses Random Graphs Courses

Course Description

Overview

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.

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

Related Courses

理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
Introducción a la Teoría Combinatoria
Universidad Católica de Murcia via Miríadax
离散数学概论 Discrete Mathematics Generality
Peking University via Coursera
Discrete Mathematics
Indian Institute of Technology, Ropar via Swayam
Discrete Mathematics
Shanghai Jiao Tong University via Coursera