The asymptotic number of acyclic digraphs. I-Reference-Cited by-同舟云学术

The asymptotic number of acyclic digraphs. I

Published:1986-03 Issue:1 Volume:6 Page:15-22
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Bender E. A.,Richmond L. B.,Robinson R. W.,Wormald N. C.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/BF02579404.pdf

Reference8 articles.

1. B. V. Gnedenko andA. N. Kolmogorov,Limit Distributions for Sums of Independent Random Variables (trans. from Russian by K. L. Chung), Addison-Wesley, Reading, Mass. (1954, rev. 1968).

2. L. Hörmander,Introduction to Complex Analysis in Several Variables, North-Holland, Amsterdam (1973).

3. E. N. Laguerre, Mémoire sur la théorie des équations numériques,J. Math. (3)9 (1883), 99–146.

4. V. A. Liskovets, The number of maximal vertices of a random acyclic digraph (Russian),Teor, Verojatnost. i Primenen. 20 (1975), 412–421.

5. G. Pólya andJ. Schur, Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen,J. Reine Angew. Math. 144 (1914), 89–113.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The birth of the strong components;Random Structures & Algorithms;2023-08-07

2. Asymptotic enumeration of compacted binary trees of bounded right height;Journal of Combinatorial Theory, Series A;2020-05

3. Is Hyper-extensionality Preservable Under Deletions of Graph Elements?;Electronic Notes in Theoretical Computer Science;2016-04

4. The Limits of Piecemeal Causal Inference;The British Journal for the Philosophy of Science;2014-06-01

5. Uniform random generation of large acyclic digraphs;Statistics and Computing;2013-11-08