YoVDO

Perfect Matchings in Hyperfinite Graphings - Lecture 1

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 fascinating world of perfect matchings in hyperfinite graphings in this one-hour lecture by Gabor Kun. Delve into the geometric structure of amenable groups and hyperfinite graphings, focusing on their bipartite cases and the typical existence of perfect matchings. Discover how recent breakthroughs in this field have led to significant advancements, including the solution to Tarski's circle squaring problem using measurable and Borel pieces. Examine the wide-ranging applications of perfect matchings, from probability theory to group theory and measurable equidecompositions. This talk, part of the Measured Group Theory series at the Centre de recherches mathématiques, offers valuable insights into this tractable yet powerful mathematical concept.

Syllabus

Gabor Kun: Perfect matchings in hyperfinite graphings I


Taught by

Centre de recherches mathématiques - CRM

Related Courses

Intermediate Network Analysis in Python
DataCamp
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