4 research outputs found
Random graphs from a block-stable class
A class of graphs is called block-stable when a graph is in the class if and
only if each of its blocks is. We show that, as for trees, for most -vertex
graphs in such a class, each vertex is in at most blocks, and each path passes through at most blocks.
These results extend to `weakly block-stable' classes of graphs