Skip to main content Accessibility help




We characterize the structural impediments to the existence of Borel perfect matchings for acyclic locally countable Borel graphs admitting a Borel selection of finitely many ends from their connected components. In particular, this yields the existence of Borel matchings for such graphs of degree at least three. As a corollary, it follows that acyclic locally countable Borel graphs of degree at least three generating μ-hyperfinite equivalence relations admit μ-measurable matchings. We establish the analogous result for Baire measurable matchings in the locally finite case, and provide a counterexample in the locally countable case.



Hide All
[1] Csóka, E. and Lippner, G., Invariant random matchings in Cayley graphs, preprint available at
[2] Conley, C. T. and Miller, B. D., A bound on measurable chromatic numbers of locally finite Borel graphs, Mathematical Research Letters, preprint available at benjamin.miller, to appear.
[3] Dougherty, R. L., Jackson, S. C., and Kechris, A. S., The structure of hyperfinite Borel equivalence relations . Transaction of the American Mathematical Society, vol. 341 (1994), no. 1, pp. 193225.
[4] Harrington, L. A., Kechris, A. S., and Louveau, A., A Glimm-Effros dichotomy for Borel equivalence relations . Journal of American Mathematical Society, vol. 3 (1990), no. 4, pp. 903928.
[5] Hjorth, G. and Miller, B. D., Ends of graphed equivalence relations. II . Israel Journal of Mathematics, vol. 169 (2009), pp. 393415.
[6] Jackson, S., Kechris, A. S., and Louveau, A., Countable Borel equivalence relations . Journal of Mathematical Logic, vol. 2 (2002), no. 1, pp. 180.
[7] Kechris, A. S., Classical Descriptive Set Theory, Graduate Texts in Mathematics, vol. 156, Springer-Verlag, New York, 1995.
[8] Kechris, A. S. and Marks, A. S., Descriptive graph combinatorics, available at∼marks/.
[9] Kechris, A. S. and Miller, B. D., Topics in Orbit Equivalence, Lecture Notes in Mathematics, vol. 1852, Springer-Verlag, Berlin, 2004.
[10] Kechris, A. S., Solecki, S., and Todorcevic, S., Borel chromatic numbers . Advances in Mathematics, vol. 141 (1999), no. 1, pp. 144.
[11] Lyons, R. and Nazarov, F., Perfect matchings as IID factors on non-amenable groups . European Journal of Combinatorics, vol. 32 (2011), no. 7, pp. 11151125.
[12] Marks, A. S., A determinacy approach to Borel combinatorics , Journal of the American Mathematical Society, vol. 29 (2016), pp. 579600.
[13] Miller, B. D., The graph-theoretic approach to descriptive set theory . Bulletin of Symbolic Logic, vol. 18 (2012), no. 4, pp. 554575.
[14] Marks, A. S. and Unger, S., Baire measurable paradoxical decompositions via matchings , Advances in Mathematics, vol. 289 (2016), pp. 397410.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed