Hereditary classes of ordered binary structures

From MaRDI portal
Publication:6136170

DOI10.21494/ISTE.OP.2020.0542arXiv1901.09363MaRDI QIDQ6136170FDOQ6136170


Authors: Djamila Oudrar Edit this on Wikidata


Publication date: 28 August 2023

Published in: Advances in Pure and Applied Mathematics (Search for Journal in Brave)

Abstract: Balogh, Bollob'{a}s and Morris (2006) have described a threshold phenomenon in the behavior of the profile of hereditary classes of ordered graphs. In this paper, we give an other look at their result based on the notion of monomorphic decomposition of a relational structure introduced in cite{P-T-2013}. We prove that the class mathfrakS of ordered binary structures which do not have a finite monomorphic decomposition has a finite basis (a subset mathfrakA such that every member of mathfrakS embeds some member of mathfrakA). In the case of ordered reflexive directed graphs, the basis has 1242 members and the profile of their ages grows at least as the Fibonacci function. From this result, we deduce that the following dichotomy property holds for every hereditary class mathfrakC of finite ordered binary structures of a given finite type. Either there is an integer ell such that every member of mathfrakC has a monomorphic decomposition into at most ell blocks and in this case the profile of mathfrakC is bounded by a polynomial of degree ell1 (and in fact is a polynomial), or mathfrakC contains the age of a structure which does not have a finite monomorphic decomposition, in which case the profile of mathfrakC is bounded below by the Fibonacci function.


Full work available at URL: https://arxiv.org/abs/1901.09363




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Hereditary classes of ordered binary structures

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