Asymptotic enumeration of strongly connected digraphs by vertices and edges

DOI10.1002/rsa.20416zbMath1270.05058arXiv1005.1285OpenAlexW2073677433WikidataQ57991439 ScholiaQ57991439MaRDI QIDQ2844083

Xavier Pérez-Giménez, Nicholas C. Wormald

Publication date: 27 August 2013

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

Full work available at URL: https://arxiv.org/abs/1005.1285

zbMATH Keywords

asymptotic enumerationdirected graphsstrongly connected

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Asymptotic enumeration (05A16) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (3)

The critical window in random digraphs ⋮ Birth of a giant \((k_{1},k_{2})\)-core in the random digraph ⋮ Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Encores on cores
• Counting connected graphs inside-out
• Asymptotic enumeration of sparse graphs with a minimum degree constraint
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• FORMULAE FOR THE NUMBER OF SPARSELY-EDGED STRONG LABELLED DIGRAPHS
• The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
• An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph

This page was built for publication: Asymptotic enumeration of strongly connected digraphs by vertices and edges