Structure and enumeration theorems for hereditary properties in finite relational languages

Caroline Terry

Given a finite relational language $\calL$, a hereditary $\calL$-property is a class of finite $\calL$-structures which is closed under isomorphism and model theoretic substructure…