D\'ecomposition monomorphe des structures relationnelles et profil de classes h\'er\'editaires

Publication date: 4 September 2014

Abstract: We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We start with the following notion due to N.Thi'ery and the second author. A emph{monomorphic decomposition} of a relational structure

R

is a partition of its domain

V (R)

into a family of sets

(V_{x})_{x i n X}

such that the restrictions of

R

to two finite subsets

A

and

A^{'}

of

V (R)

are isomorphic provided that the traces

A c a p V_{x}

and

A^{'} c a p V_{x}

have the same size for each

x i n X

. Let

m a t h s c r S_{m} u

be the class of relational structures of signature

m u

which do not have a finite monomorphic decomposition. We show that if a hereditary subclass

m a t h s c r D

of

m a t h s c r S_{m} u

is made of ordered relational structures then it contains a finite subset

m a t h f r a k A

such that every member of

m a t h s c r D

embeds some member of

m a t h f r a k A

. Furthermore, for each

R i n m a t h f r a k A

the profile of the age

m a t h c a l A (R)

of

R

(made of finite substructures of

R

) is at least exponential. We deduce that if the profile of a hereditary class of finite ordered structures is not bounded by a polynomial then it is at least exponential. This result is a part of classification obtained by Balogh, Bollob'as and Morris (2006) for ordered graphs. {it To cite this article: Djamila Oudrar, Maurice Pouzet, C. R. Acad. Sci. Paris, Ser. I.}

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Model theory of finite structures (03C13) Ordered structures (06F99)

This page was built for publication: D\'ecomposition monomorphe des structures relationnelles et profil de classes h\'er\'editaires

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