Login / Signup

An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph.

Graeme KemkesNicholas C. Wormald
Published in: SIAM J. Discret. Math. (2013)
Keyphrases
  • upper bound
  • random graphs
  • lower bound
  • graph theoretic
  • phase transition
  • worst case
  • maximum number
  • social networks
  • undirected graph
  • small world
  • probability distribution
  • information extraction