Definable Combinatorics of Graphs and Equivalence Relations

Definable Combinatorics of Graphs and Equivalence Relations

<p>Let <b>D</b> = (<i>X</i>, <i>D</i>) be a Borel directed graph on a standard Borel space <i>X</i> and let <i>χ<sub>B</sub></i>(<b>D</b>) be its Borel chromatic number. If <i>F</i><sub>0</...

Full description

Bibliographic Details
Main Author: Meehan, Connor George Walmsley
Format: Others
Published: 2018
Online Access:https://thesis.library.caltech.edu/11006/1/meehan_connor_2018.pdf
Meehan, Connor George Walmsley (2018) Definable Combinatorics of Graphs and Equivalence Relations. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/45E4-MC27. https://resolver.caltech.edu/CaltechTHESIS:06012018-160828760 <https://resolver.caltech.edu/CaltechTHESIS:06012018-160828760>

Internet

https://thesis.library.caltech.edu/11006/1/meehan_connor_2018.pdf
Meehan, Connor George Walmsley (2018) Definable Combinatorics of Graphs and Equivalence Relations. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/45E4-MC27. https://resolver.caltech.edu/CaltechTHESIS:06012018-160828760 <https://resolver.caltech.edu/CaltechTHESIS:06012018-160828760>

Similar Items