The asymptotic number of labeled connected graphs with a given number of vertices and edges

DOI10.1002/RSA.3240010202zbMATH Open0745.05022OpenAlexW1986766834MaRDI QIDQ3977071FDOQ3977071

Authors: Edward A. Bender, E. Rodney Canfield, Brendan D. McKay 

Publication date: 25 June 1992

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240010202

Recommendations

• Asymptotic properties of labeled connected graphs
• Asymptotic enumeration of sparse 2-connected graphs
• The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices
• scientific article; zbMATH DE number 4075100
• scientific article; zbMATH DE number 1504594

zbMATH Keywords

number of connected labeled graphs

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Enumeration in graph theory (05C30)

Cites Work

• Wright and Stepanov-Wrigth coefficients

Cited In (45)

• Asymptotic enumeration of sparse 2-connected graphs
• On enumeration of labelled connected graphs by the number of cutpoints
• Title not available (Why is that?)
• Asymptotic enumeration of labelled graphs by genus
• Brownian approximation to counting graphs
• Maximum information stored in a labeled connected network with minimum edges
• On the growth of components with non-fixed excesses
• Local limit theorems for the giant component of random hypergraphs
• Counting connected hypergraphs via the probabilistic method
• Title not available (Why is that?)
• The number of connected sparsely edged uniform hypergraphs
• The probability of unusually large components in the near-critical Erdős-Rényi graph
• An asymptotics for the number of labelled planar tetracyclic and pentacyclic graphs
• The asymptotic number of connected \(d\)-uniform hypergraphs
• Forbidden subgraphs in connected graphs
• 2-Xor revisited: satisfiability and probabilities of functions
• On the largest component of the random graph at a nearcritical stage
• Birth and growth of multicyclic components in random hypergraphs
• The MAX-CUT of sparse random graphs
• Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs
• Asymptotic enumeration of strongly connected digraphs by vertices and edges
• Counting strongly-connected, moderately sparse directed graphs
• Counting connected graphs asymptotically
• Analytic combinatorics of connected graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Counting connected graphs with large excess
• Qualitative, statistical, and extreme properties of spectral indices of signable pseudo-invertible graphs
• Counting connected graphs inside-out
• A formula for the number of labeled connected graphs
• ASYMPTOTIC NUMBER OF GENERAL CUBIC GRAPHS WITH GIVEN CONNECTIVITY
• Title not available (Why is that?)
• Title not available (Why is that?)
• Asymptotic enumeration of sparse graphs with a minimum degree constraint
• The phase transition in a random hypergraph
• The number of connected graphs with \(k\) cycles on labeled nodes
• The critical random graph, with martingales
• Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities
• Another proof of Wright's inequalities
• Asymptotic properties of labeled connected graphs
• The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices
• Title not available (Why is that?)
• Enumeration of labeled connected graphs with given order and size
• Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs
• The scaling window of the 2-SAT transition

This page was built for publication: The asymptotic number of labeled connected graphs with a given number of vertices and edges

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