We give a simple proof that the straightforward generalisation of clique-width to arbitrary structures can be unbounded on structures of bounded tree-width. This can be corrected by allowing fusion of elements.
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness notion from algorithmic graph theory is essentially the earlier stability theoretic notion of superflatness. For subgraph-closed classes of graphs we prove equivalence to stability… (More)
BACKGROUND In the Swedish society, as in many other societies, many children and adolescents with mental health problems do not receive the help they need. As the Swedish society becomes increasingly multicultural, and as ethnic and economic residential segregation become more pronounced, this study utilises ethnicity and neighbourhood context to examine… (More)
We prove two results about generically stable types p in arbitrary theories. The first, on existence of strong germs, generalizes results from  on stably dominated types. The second is an equivalence of forking and dividing, assuming generic stability of p (m) for all m. We use the latter result to answer in full generality a question posed by Hasson and… (More)