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</...