Isolated cycles of critical random graphs
Document typeConference report
PublisherSociety for Industrial and Applied Mathematics (SIAM)
Rights accessOpen Access
Consider the Erdos-Renyi random graph G(n, M) built with n vertices and M edges uniformly randomly chosen from the set of n2 edges. Let L be a set of positive integers. For any number of edges M 6n/2 + O(n 2/3 ), we compute – via analytic combinatorics – the number of isolated cycles of G(n, M) whose length is in L.
CitationNoy, M., Rasendrahasina, V., Ravelomanana, V., Rue, J. Isolated cycles of critical random graphs. A: Workshop on Analytic Algorithmics and Combinatorics. "Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2017, Barcelona, Spain, Hotel Porta Fira, January 16-17, 2017". Barcelona: Society for Industrial and Applied Mathematics (SIAM), 2017, p. 46-55.