The evolution of the min-min random graph process
type: Item
instance of: scholarly article
title: The evolution of the min-min random graph process
zbMATH Open document ID: 1187.05067
author: Amin Coja-Oghlan
author: Mihyun Kang
published in: Discrete Mathematics
publication date: 2009-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 5644973
zbMATH Keywords: random graph
zbMATH Keywords: random graph process
zbMATH Keywords: connectedness
zbMATH Keywords: giant component
MaRDI profile type: Publication
full work available at URL: j.disc.2009.02.015
OpenAlex ID: W1971981699
cites work: The asymptotic number of labeled graphs with given degree sequences
cites work: Paths in graphs
cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
cites work: Q3286850
cites work: Q5541610
cites work: Random hypergraph processes with degree restrictions
cites work: Q4471152
cites work: The Critical Phase for Random Graphs with a Given Degree Sequence
cites work: Phase transition of the minimum degree random multigraph process
cites work: Generating random regular graphs
cites work: A critical point for random graphs with a given degree sequence
cites work: On distributions related to transitive closures of random finite mappings
cites work: Q4715275
cites work: Random Star Processes
cites work: Random Graph Processes with Degree Restrictions
cites work: Connectedness of graphs generated by a random d-process
cites work: Generating Random Regular Graphs Quickly
cites work: Cycles in a Uniform Graph Process
cites work: Q4697461
cites work: The connectivity threshold for the min‐degree random graph process
cites work: Q4519896
cites work: Q4263664
DOI: 10.1016/J.DISC.2009.02.015
description: scientific article; zbMATH DE number 5644973