Counting extensional acyclic digraphs
Highlights
► Counting transitive sets is equivalent to counting extensional acyclic digraphs. ► We give a recurrence formula for labeled extensional acyclic digraphs. ► We count (weakly) extensional acyclic digraphs by sources. ► We also count (weakly) extensional acyclic digraphs by vertices of maximum rank.
References (19)
Acyclic orientations of graphs
Discrete Math.
(1973)- et al.
The asymptotic number of acyclic digraphs, II
J. Comb. Theory
(1988) Counting acyclic digraphs by sources and sinks
Discrete Math.
(1996)Orientations acycliques et le polynôme chromatique
Eur. J. Comb.
(2001)Exact enumeration of acyclic deterministic automata
Discrete Appl. Math.
(2006)Basic Set Theory
(1979)The number of full sets with n elements
Proc. Amer. Math. Soc.
(1962)Die Widerspruchsfreiheit der allgemeinen Mengenlehre
Math. Ann.
(1937)Advanced Combinatorics
(1974)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2011 Elsevier B.V. All rights reserved.