Counting extensional acyclic digraphs

DOI10.1016/j.ipl.2011.05.014zbMath1260.05077OpenAlexW2086562122MaRDI QIDQ1944136

Alexandru I. Tomescu, Alberto Policriti

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.05.014

zbMATH Keywords

automorphism groupcombinatorial problemsset theoryrecurrence formulatransitive setextensional digraph

Mathematics Subject Classification ID

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

Related Items (5)

Asymptotic enumeration of extensional acyclic digraphs ⋮ Digraph parameters and finite set arithmetic ⋮ Set graphs. IV. Further connections with claw-freeness ⋮ Ordinal operations on graph representations of sets ⋮ Unnamed Item

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs
• The asymptotic number of acyclic digraphs. I
• The asymptotic number of acyclic digraphs. II
• Counting acyclic digraphs by sources and sinks
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• Exact enumeration of acyclic deterministic automata
• Acyclic orientations of graphs
• Well-Quasi-Ordering Hereditarily Finite Sets
• The Number of Full Sets with n Elements
• Acyclic orientations and the chromatic polynomial

This page was built for publication: Counting extensional acyclic digraphs