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
Intermediate Network Analysis in PythonDataCamp Discriminative Prototype Selection for Graph Embedding
University of Central Florida via YouTube Canonical Structures Inside Platonic Solids II - Universal Hyperbolic Geometry
Insights into Mathematics via YouTube Stability and Combinatorics in Pure Model Theory - Lecture 11
Fields Institute via YouTube More on Graphs and Euler's Formula in Algebraic Topology - Lecture 10
Insights into Mathematics via YouTube