scientific article; zbMATH DE number 4179410

MaRDI QIDQ3203052zbMATH OpenFDO

Authors Andrzej Ruciński

Publication date 1990

zbMATH Keywords

asymptotic enumerationd-graphsrandom graphunsaturated vertices

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Asymptotic Enumeration of Graphs with a Given Upper Bound on the Maximum Degree
• Random graphs with bounded maximum degree: asymptotic structure and a logical limit law
• The asymptotic number of graphs with a restriction on the maximum degree
• On the size of a random maximal graph
• The maximum degree of a random graph
• On the Maximum Degree of a Random Planar Graph
• On the distribution of the maximum k-degrees of the binomial random graph
• Random graphs with a fixed maximum degree

Cited in

(7)

• On the asymptotics of degree structure of configuration graphs with bounded number of edges
• On the exact maximum induced density of almost all graphs and their inducibility
• The asymptotic number of graphs with a restriction on the maximum degree
• Graphs with degree sets of maximal cardinality: a handshaking problem revisited
• Random graphs with bounded maximum degree: asymptotic structure and a logical limit law
• The sequential generation of random \(f\)-graphs. Distributions and predominant types of edge maximal \(f\)-graphs with \(f>4\)
• Sharper analysis of the random graph d-process via a balls-in-bins model

This page was built for publication:

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