Discrete Mathematics & Theoretical Computer Science 
This work is devoted to the study of typical properties of random graphs from classes with structural constraints, like for example planar graphs, with the additional restriction that the average degree is fixed. More precisely, within a general analytic framework, we provide sharp concentration results for the number of blocks (maximal biconnected subgraphs) in a random graph from the class in question. Among other results, we discover that essentially such a random graph belongs with high probability to only one of two possible types: it either has blocks of at most logarithmic size, or there is a \emphgiant block that contains linearly many vertices, and all other blocks are significantly smaller. This extends and generalizes the results in the previous work [K. Panagiotou and A. Steger. Proceedings of the 20th Annual ACMSIAM Symposium on Discrete Algorithms (SODA '09), pp. 432440, 2009], where similar statements were shown without the restriction on the average degree.
Source : ScholeXplorer
IsRelatedTo ARXIV 1605.04340 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.1605.04340
