Perfect Matchings in Hyperfinite Graphings - Lecture 2
Offered By: Centre de recherches mathématiques - CRM via YouTube
Course Description
Overview
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
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