Canonical Colourings in Random Graphs
Offered By: BIMSA via YouTube
Course Description
Overview
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
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer