Permutation groups are one of the oldest topics in algebra. Their study has recently been
revolutionized by new developments, particularly the Classification of Finite Simple Groups …

A relational first order structure is homogeneous if it is countable (possibly finite) and every
isomorphism between finite substructures extends to an automorphism. This article is a …

This in-depth coverage of important areas of graph theory maintains a focus on symmetry
properties of graphs. Standard topics on graph automorphisms are presented early on, while …

This survey article is devoted to general results in combinatorial enumeration. The first part
surveys results on growth of hereditary properties of combinatorial structures. These include …

The aim of this lecture is to survey some of the striking applications of the theory of well
quasi-order (wqo) and better quasi-order (bqo) and to illustrate with examples how one can …

The profile of a relational structure $ R $ is the function $\varphi_R $ which counts for every
integer $ n $ the number $\varphi_R (n) $, possibly infinite, of substructures of $ R $ induced …

The {\it profile} of a relational structure $ R $ is the function $\phi_R $ which counts for every
integer $ n $ the number of its $ n $-element substructures up to an isomorphism. Many …

A tournament is acyclically indecomposable if no acyclic autonomous set of vertices has
more than one element. We identify twelve infinite acyclically indecomposable tournaments …

An equivalence on the family of subsets of an e-element set E is hereditary if| a|=| b| and| x
{⊆ a: x∼}|=| x {⊆ b: x∼}| whenever a, b, c,⊂ E and a˜ b. Let W i˜ denote the number of …

Ce travail s' inscrit dans le cadre de la théorie des relations. Il porte sur l'énumération des
structures finies. Etant donnée une classe C de structures combinatoires finies, le profil de C …