The first cycles in an evolving graph

DOI10.1016/0012-365X(89)90087-3MaRDI QIDQ910415zbMATH OpenOpenAlexFDO

Authors Philippe Flajolet, Donald E. Knuth, Boris Pittel

Publication date 1989

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(89)90087-3

zbMATH Keywords

generating functionsrandom graph processgraph evolution

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15) Paths and cycles (05C38)

Recommendations

• First cycles in random directed graph processes
• Multicyclic components in a random graph process
• scientific article; zbMATH DE number 3168330
• scientific article; zbMATH DE number 2066194
• Cycles in a Uniform Graph Process

Cites work

• scientific article; zbMATH DE number 3134390 (Why is no real title available?)
• scientific article; zbMATH DE number 3814037 (Why is no real title available?)
• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• scientific article; zbMATH DE number 3902655 (Why is no real title available?)
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3349816 (Why is no real title available?)
• scientific article; zbMATH DE number 3373676 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• A Random Graph With a Subcritical Number of Edges
• Poisson convergence and Poisson processes with applications to random graphs
• The expected linearity of a simple equivalence algorithm
• The number of connected sparsely edged graphs

Cited in

(37)

• The Diagonal Poisson Transform and its application to the analysis of a hashing scheme
• A double large prime variation for small genus hyperelliptic index calculus
• On the probability of planarity of a random graph near the critical point
• On the threshold for k-regular subgraphs of random graphs
• Multicyclic components in a random graph process
• Cycles of given lengths in unicyclic components in sparse random graphs
• The maximal length of 2-path in random critical graphs
• Parking functions for mappings
• The Bohman-Frieze process near criticality
• Random 2-XORSAT at the Satisfiability Threshold
• Analytic description of the phase transition of inhomogeneous multigraphs
• On the number of circuits in random graphs
• On the chromatic number of a random hypergraph
• \(D\cdot E\cdot K=(100)_8\)
• Cores of random \(r\)-partite hypergraphs
• Forbidden subgraphs in connected graphs
• 2-Xor revisited: satisfiability and probabilities of functions
• Expected Maximum Block Size in Critical Random Graphs
• Cycles in a Uniform Graph Process
• Infinitary logics and very sparse random graphs
• Multiscale dynamics of an adaptive catalytic network
• The MAX-CUT of sparse random graphs
• Parking on Cayley trees and frozen Erdős-Rényi
• The cook-book approach to the differential equation method
• When does the top homology of a random simplicial complex vanish?
• Counting connected graphs with large excess
• Random 2 XORSAT phase transition
• Large cycles in random generalized Johnson graphs
• A critical point for random graphs with a given degree sequence
• Random maps, coalescing saddles, singularity analysis, and Airy phenomena
• First cycles in random directed graph processes
• Non-principal Branches of Lambert W. A Tale of 2 Circles
• Threshold functions for small subgraphs in simple graphs and multigraphs
• Cycles in a random graph near the critical point
• Branch structure and implementation of Lambert \(W\)
• Perfect hashing
• The birth of the strong components

This page was built for publication: The first cycles in an evolving graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910415)