Borel Colouring Bad Sequences

DOI10.1007/S11083-021-09590-3MaRDI QIDQ6358303arXivFDO

Authors Keegan Dasilva Barbosa

Publication date 14 January 2021

Published in arXiv

Full work available at URL https://doi.org/10.1007/S11083-021-09590-3

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

arXiv classification

math.LO

Abstract: Every better quasi-order codifies a Borel graph that does not contain a copy of the shift graph. It is known that there is a better quasi-order that codes a Borel graph with infinite Borel chromatic number, though one has yet to be explicitly constructed. In this paper, we show that examples cannot be constructed via standard methods. Moreover, we show that most of the known better quasi-orders are non-examples, suggesting there is still a class of better quasi-orders with interesting combinatorial properties who's elements/members still remain unknown.

This page was built for publication: Borel Colouring Bad Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6358303)