YoVDO

Perfect Matchings in Hyperfinite Graphings - Lecture 2

Offered By: Centre de recherches mathématiques - CRM via YouTube

Tags

Graph Theory Courses Group Theory Courses Probability Theory Courses Bipartite Graphs Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the intricacies of perfect matchings in hyperfinite graphings in this 44-minute lecture by Gabor Kun, part of the Measured Group Theory series at the Centre de recherches mathématiques. Delve into the geometric structure of amenable groups and hyperfinite graphings, focusing on the existence of perfect matchings in bipartite cases. Discover recent breakthrough results related to perfect matchings, including the solution to Tarski's circle squaring problem using measurable and Borel pieces. Examine applications ranging from probability theory to group theory and measurable equidecompositions, highlighting the versatility and importance of perfect matchings in various mathematical domains.

Syllabus

Gabor Kun: Perfect matchings in hyperfinite graphings II


Taught by

Centre de recherches mathématiques - CRM

Related Courses

Introduction to Statistics: Probability
University of California, Berkeley via edX
Aléatoire : une introduction aux probabilités - Partie 1
École Polytechnique via Coursera
Einführung in die Wahrscheinlichkeitstheorie
Johannes Gutenberg University Mainz via iversity
Combinatorics and Probability
Moscow Institute of Physics and Technology via Coursera
Probability
University of Pennsylvania via Coursera