Learn More
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)
  • 1