The evolution of the min-min random graph process

DOI10.1016/j.disc.2009.02.015zbMath1187.05067OpenAlexW1971981699MaRDI QIDQ1043986

Mihyun Kang, Amin Coja-Oghlan

Publication date: 10 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.02.015

zbMATH Keywords

connectednessrandom graphrandom graph processgiant component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items

A remark on the spectra of random graphs with given expected degrees ⋮ Evolution of random graph processes with degree constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random hypergraph processes with degree restrictions
• On distributions related to transitive closures of random finite mappings
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Cycles in a Uniform Graph Process
• Random Graph Processes with Degree Restrictions
• Connectedness of graphs generated by a random d-process
• A critical point for random graphs with a given degree sequence
• Generating Random Regular Graphs Quickly
• Paths in graphs
• Random Star Processes
• Phase transition of the minimum degree random multigraph process
• The Critical Phase for Random Graphs with a Given Degree Sequence
• The connectivity threshold for the min‐degree random graph process
• Generating random regular graphs