• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

A scaling limit for the length of the longest cycle in a sparse random graph.

Michael AnastosAlan M. Frieze
Published in: J. Comb. Theory, Ser. B (2021)
Keyphrases
  • random graphs
  • graph theoretic
  • maximum number
  • phase transition
  • np complete
  • complex networks
  • undirected graph
  • small world