Logic Seminar

One-ended subforests and strong treeability

Andrew Marks, Postdoctoral Scholar, Mathematics, Caltech,

Given a measure preserving Borel graph G on a standard
probability space, we characterize when G has a Borel a.e. one-ended
spanning subforest. We apply our characterization to show that planar
groups are strongly treeable. This is joint work with Clinton Conley,
Damien Gaboriau, and Robin Tucker-Drob.

Event Sponsors:

Mathematics - More events from this Sponsor

For more information, please contact Alexander Kechris by email at [email protected] or visit http://www.math.caltech.edu/~logic/index.html.