YoVDO

Canonical Colourings in Random Graphs

Offered By: BIMSA via YouTube

Tags

Random Graphs Courses Combinatorics Courses Graph Theory Courses Probability Theory Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore canonical colourings in random graphs through a 51-minute lecture by Nina Kamčev, an associate professor at the University of Zagreb. Delve into her research interests, including extremal combinatorics, Ramsey theory, random graphs and processes, asymptotic enumeration, and arithmetic combinatorics. Learn about Kamčev's academic background, including her Ph.D. from ETH Zurich under Benny Sudakov's supervision, and her research positions at Monash University and the University of Zagreb. Discover her recent accolades, such as the CMSA Prize awarded by the Combinatorial Mathematics Society of Australasia in 2023, and gain insights into her contributions to the field of mathematics.

Syllabus

Nina Kamčev: Canonical colourings in random graphs


Taught by

BIMSA

Related Courses

Analytic Combinatorics, Part I
Princeton University via Coursera Analytic Combinatorics, Part II
Princeton University via Coursera Analytic Combinatorics
Princeton University via Coursera Principles of Computing (Part 1)
Rice University via Coursera Combinatorics and Probability
Moscow Institute of Physics and Technology via Coursera