Time: | 3:30pm - 4:30 pm |
Room: |
Wean Hall 8220
|
Speaker: |
Clinton Conley Department of Mathematical Sciences CMU |
Title: |
Ode on a one-ended subforest
|
Abstract: |
Many arguments in (finite) graph theory follow this pattern: postpone some onerous task until the last possible moment, after you've arranged things to make the task as easy as possible. In the descriptive set-theoretic milieu, the one-ended forest provides a portal to a procrastinator's wonderland in which the onerous task instead wanders off to infinity. We discuss a few instances of this phenomenon and some applications to coloring and treeing graphs. |