[go: up one dir, main page]

login
Revision History for A003025 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of n-node labeled acyclic digraphs with 1 out-point.
(history; published version)
#33 by Michael De Vlieger at Thu Jan 04 18:11:22 EST 2024
STATUS

proposed

approved

#32 by Gus Wiseman at Thu Jan 04 15:16:05 EST 2024
STATUS

editing

proposed

#31 by Gus Wiseman at Wed Jan 03 19:19:24 EST 2024
COMMENTS

Also the number of set-systems with n vertices, -element sets of finite nonempty subsets of {1..n edges, }, including a unique singleton, and only such that there is exactly one way to choose a different vertex element from each edge. For example, the a(0) = 0 through a(3) = 15 set-systems are:

FORMULA

a(n)/n = (-1)^(n-1) * n * A134531(n). - Gus Wiseman, Jan 02 2024

CROSSREFS

For a fixed sink we have A134531 (up to sign), column k=1 of A368602.

A058891 counts set-systems, unlabeled A000612.

A059201 counts covering T_0 set-systems.

A323818 counts covering connected set-systems, unlabeled A323819.

A361718 counts acyclic digraphs by number of sinks, fixed A368602.

Cf. A000169, ~A003465, A058891, A059201, A082402, `A088957, ~A133686, A323818, A334282, `A367862, A367904, `A367908, A368600, A368601.

#30 by Gus Wiseman at Tue Jan 02 13:55:21 EST 2024
COMMENTS

From Gus Wiseman, Jan 02 2024: (Start)

Also the number of set-systems with n vertices, n edges, a unique singleton, and only one way to choose a different vertex from each edge. For example, the a(0) = 0 through a(3) = 15 set-systems are:

. {{1}} {{1},{1,2}} {{1},{1,2},{1,3}}

{{2},{1,2}} {{1},{1,2},{2,3}}

{{1},{1,3},{2,3}}

{{2},{1,2},{1,3}}

{{2},{1,2},{2,3}}

{{2},{1,3},{2,3}}

{{3},{1,2},{1,3}}

{{3},{1,2},{2,3}}

{{3},{1,3},{2,3}}

{{1},{1,2},{1,2,3}}

{{1},{1,3},{1,2,3}}

{{2},{1,2},{1,2,3}}

{{2},{2,3},{1,2,3}}

{{3},{1,3},{1,2,3}}

{{3},{2,3},{1,2,3}}

These set-systems are all connected.

The case of labeled graphs is A000169.

(End)

FORMULA

a(n)/n = (-1)^(n-1) * A134531(n). - Gus Wiseman, Jan 02 2024

MATHEMATICA

Table[Length[Select[Subsets[Subsets[Range[n]], {n}], Count[#, {_}]==1&&Length[Select[Tuples[#], UnsameQ@@#&]]==1&]], {n, 0, 4}] (* Gus Wiseman, Jan 02 2024 *)

CROSSREFS

For any number of sinks we have A003024, unlabeled A003087.

For n-1 sinks we have A058877.

For a fixed sink we have A134531 (up to sign).

A058891 counts set-systems, unlabeled A000612.

A059201 counts covering T_0 set-systems.

A323818 counts covering connected set-systems, unlabeled A323819.

A361718 counts acyclic digraphs by number of sinks, fixed A368602.

Cf. A000169, ~A003465, A082402, `A088957, ~A133686, A334282, `A367862, A367904, `A367908, A368600, A368601.

STATUS

approved

editing

#29 by Michael De Vlieger at Thu Apr 06 08:34:17 EDT 2023
STATUS

reviewed

approved

#28 by Joerg Arndt at Thu Apr 06 02:28:21 EDT 2023
STATUS

proposed

reviewed

#27 by Geoffrey Critzer at Sun Apr 02 12:53:31 EDT 2023
STATUS

editing

proposed

#26 by Geoffrey Critzer at Sun Apr 02 12:53:13 EDT 2023
CROSSREFS

Column k=1 of A361718.

STATUS

approved

editing

#25 by N. J. A. Sloane at Sat Jan 01 21:21:36 EST 2022
STATUS

proposed

approved

#24 by Andrew Howroyd at Sat Jan 01 19:49:33 EST 2022
STATUS

editing

proposed