Journal of Applied Mathematics

The Maximal Length of 2-Path in Random Critical Graphs

Vonjy Rasendrahasina, Vlady Ravelomanana, and Liva Aly Raonenantsoamihaja

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

Given a graph, its 2 -core is the maximal subgraph of G without vertices of degree 1 . A 2 -path in a connected graph is a simple path in its 2 -core such that all vertices in the path have degree 2 , except the endpoints which have degree 3 . Consider the Erdős-Rényi random graph G ( n , M ) built with n vertices and M edges uniformly randomly chosen from the set of n 2 edges. Let ξ n , M be the maximum 2 -path length of G ( n , M ) . In this paper, we determine that there exists a constant c ( λ ) such that E ξ n , n / 2 1 + λ n - 1 / 3 ~ c ( λ ) n 1 / 3 , f o r a n y r e a l λ . This parameter is studied through the use of generating functions and complex analysis.

Article information

Source
J. Appl. Math., Volume 2018 (2018), Article ID 8983218, 5 pages.

Dates
Received: 1 December 2017
Accepted: 3 April 2018
First available in Project Euclid: 13 June 2018

Permanent link to this document
https://projecteuclid.org/euclid.jam/1528855298

Digital Object Identifier
doi:10.1155/2018/8983218

Mathematical Reviews number (MathSciNet)
MR3806007

Citation

Rasendrahasina, Vonjy; Ravelomanana, Vlady; Aly Raonenantsoamihaja, Liva. The Maximal Length of 2-Path in Random Critical Graphs. J. Appl. Math. 2018 (2018), Article ID 8983218, 5 pages. doi:10.1155/2018/8983218. https://projecteuclid.org/euclid.jam/1528855298


Export citation

References

  • S. Janson, D. E. Knuth, T. Luczak, and B. Pittel, “The birth of the giant component,” Random Structures & Algorithms, vol. 4, no. 3, pp. 231–358, 1993.
  • P. Erdős and A. Rényi, “On the evolution of random graphs,” Publications of the Mathematical Institute of the Hungarian Academy of Sciences, vol. 5, pp. 17–61, 1960.
  • P. Flajolet, D. E. Knuth, and B. Pittel, “The first cycles in an evolving graph,” Discrete Mathematics, vol. 75, no. 1-3, pp. 167–215, 1989.
  • J. Ding, E. Lubetzky, and Y. Peres, “Anatomy of the giant component: the strictly supercritical regime,” European Journal of Combinatorics, vol. 35, pp. 155–168, 2014.
  • J. Ding, J. H. Kim, E. Lubetzky, and Y. Peres, “Anatomy of a young giant component in the random graph,” Random Structures & Algorithms, vol. 39, no. 2, pp. 139–178, 2011.
  • F. Harary and E. M. Palmer, Graphical enumeration, Academic Press, 1973.
  • A. Cayley, “A theorem on trees,” The Quarterly journal of pure and applied mathematics, vol. 23, pp. 376–378, 1889.
  • E. M. Wright, “The number of connected sparsely edged graphs,” Journal of Graph Theory, vol. 1, no. 4, pp. 317–330, 1977.
  • S. Janson, “Brownian excursion area, Wright's constants in graph enumeration, and other Brownian areas,” Probability Surveys, vol. 4, pp. 80–145, 2007.
  • E. M. Wright, “The number of connected sparsely edged graphs III. Asymptotic results,” Journal of Graph Theory, vol. 4, no. 4, pp. 393–407, 1980.
  • P. Flajolet, M. Andrew, and Odlyzko, “Random mapping statistics,” in Proceedings of the Advances in Cryptology - EUROCRYPT '89, Workshop on the Theory and Application of of Cryptographic Techniques, pp. 329–354, Houthalen, Belgium, 1989. \endinput