Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs

We define nowhere dense and somewhere dense classes by means of counting of homomorphisms from test graphs. This seems to be bridging the gap between existential and counting theorems (for graph homomorphisms) and it has application to complexity of Boolean queries.