Counting strongly connected (k1, k2)‐directed cores

DOI10.1002/RSA.20759zbMath1401.05133arXiv1609.00290OpenAlexW2963734646MaRDI QIDQ4684325

Boris G. Pittel

Publication date: 28 September 2018

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

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

zbMATH Keywords

digraphstrong connectivitycounting cores

Mathematics Subject Classification ID

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

Related Items (1)

Birth of a giant \((k_{1},k_{2})\)-core in the random digraph

This page was built for publication: Counting strongly connected (k₁, k₂)‐directed cores