Counting extensional acyclic digraphs
type: Item
instance of: scholarly article
title: Counting extensional acyclic digraphs
zbMATH Open document ID: 1260.05077
author: Alexandru I. Tomescu
author: Alberto Policriti
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 6150440
zbMATH Keywords: extensional digraph
zbMATH Keywords: transitive set
zbMATH Keywords: recurrence formula
zbMATH Keywords: automorphism group
zbMATH Keywords: combinatorial problems
zbMATH Keywords: set theory
describes a project that uses: OEIS
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.05.014
OpenAlex ID: W2086562122
cites work: Q4189277
cites work: The Number of Full Sets with n Elements
cites work: Q4769056
cites work: The On-Line Encyclopedia of Integer Sequences
cites work: Q5675746
cites work: Acyclic orientations of graphs
cites work: The asymptotic number of acyclic digraphs. I
cites work: The asymptotic number of acyclic digraphs. II
cites work: Counting acyclic digraphs by sources and sinks
cites work: Acyclic orientations and the chromatic polynomial
cites work: Exact enumeration of acyclic deterministic automata
cites work: Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs
cites work: Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
cites work: Q4187840
cites work: Q5623707
cites work: Q5682013
cites work: Well-Quasi-Ordering Hereditarily Finite Sets
cites work: Q3992552
DOI: 10.1016/J.IPL.2011.05.014
description: scientific article; zbMATH DE number 6150440