On the number of sparse connected graphs

DOI10.1002/RSA.3240010203zbMATH Open0735.05048OpenAlexW2025027844MaRDI QIDQ3977072FDOQ3977072

Authors: Tomasz Łuczak 

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.3240010203

Recommendations

• A Note on the Sparing Number of Graphs
• On the number of connected subgraphs of graphs
• Asymptotic enumeration of sparse 2-connected graphs
• The number of connected sparsely edged uniform hypergraphs
• On Ramsey Numbers of Sparse Graphs
• On the independence number of sparse graphs
• Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges
• On the spanning connectivity of graphs
• The Turán number of sparse spanning graphs

zbMATH Keywords

number of connected graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Cited In (15)

• Asymptotic enumeration of sparse 2-connected graphs
• On sparse subgraphs preserving connectivity properties
• Local limit theorems for the giant component of random hypergraphs
• The representation number of some sparse graphs
• The number of connected sparsely edged uniform hypergraphs
• On the number of connected subgraphs of graphs
• The asymptotic number of connected \(d\)-uniform hypergraphs
• Counting strongly-connected, moderately sparse directed graphs
• Counting connected graphs asymptotically
• Counting connected graphs with large excess
• A Note on the Sparing Number of Graphs
• On a random graph evolving by degrees
• Another proof of Wright's inequalities
• The probability of unusually large components in the near-critical Erdős–Rényi graph
• Edge percolation on a random regular graph of low degree

This page was built for publication: On the number of sparse connected graphs

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