A Random Graph With a Subcritical Number of Edges

DOI10.2307/2001158MaRDI QIDQ3807259zbMATH OpenOpenAlexFDO

Authors Boris Pittel

Publication date 1988

Full work available at URL https://doi.org/10.2307/2001158

zbMATH Keywords

random graphcyclescomponent-size order sequenceunicyclic components

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Limit theorems in probability theory (60F99) Enumeration in graph theory (05C30)

Recommendations

• scientific article; zbMATH DE number 6327467
• Cycles in a random graph near the critical point
• scientific article; zbMATH DE number 219310
• Cycles of given lengths in unicyclic components in sparse random graphs
• On the Behavior of a Random Graph Near a Critical Point

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3152798 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3817702 (Why is no real title available?)
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3916307 (Why is no real title available?)
• scientific article; zbMATH DE number 3693325 (Why is no real title available?)
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• A Note on the Theory of Moment Generating Functions
• Long paths in sparse random graphs
• On the height of trees
• On the number of distinct block sizes in partitions of a set
• On the probable behaviour of some algorithms for finding the stability number of a graph
• Paths in a random digital tree: limiting distributions
• Poisson convergence and random graphs
• Principles of combinatorics
• Probability of Indecomposability of a Random Mapping Function
• Regular iteration of real and complex functions
• The Enumeration of Trees by Height and Diameter
• The longest path in a random graph
• The number of connected sparsely edged graphs
• Three problems in combinatorial asymptotics

Cited in

(17)

• Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths
• Components of Random Forests
• scientific article; zbMATH DE number 6327467 (Why is no real title available?)
• Cycles of given lengths in unicyclic components in sparse random graphs
• On the cycle space of a random graph
• On tree census and the giant component in sparse random graphs
• Limiting behavior of 3-color excitable media on arbitrary graphs
• The first cycles in an evolving graph
• Expected Maximum Block Size in Critical Random Graphs
• Limit theorems for topological invariants of the dynamic multi-parameter simplicial complex
• Fluid limit and gelation in the frozen Erdős-Rényi random graph
• The largest component in a random subgraph of the \(n\)-cycle
• Gap‐Free Set Partitions
• Sharp vanishing thresholds for cohomology of random flag complexes
• Phase transition phenomena in random discrete structures
• Longest paths in random hypergraphs
• Random graphs of binomial type with sparsely-edged initial graphs

This page was built for publication: A Random Graph With a Subcritical Number of Edges

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