Component Finite Subgraphs of Treeings

Explore the mathematical concepts of component finite subgraphs of treeings in this 22-minute conference talk by Riley Thornton at the Centre de recherches mathématiques (CRM). Delve into the upper and lower bounds on the size of measurable component finite subgraphs of regular treeings, which is equivalent to bounding the measure of hyperfinite subgraphs of the associated Bernoulli graphing. Discover how sharp bounds are achieved for d=3, and learn about the estimates for d greater than 3 using the differential equations method from probabilistic combinatorics. Gain insights into this specialized topic within measured group theory as part of the "Théories des groups mesurée/ Measured Group Theory" conference held in March 2023.