The visually distinct configurations of k sets

DOI10.1016/0012-365X(81)90272-7zbMath0466.05038OpenAlexW2049455748MaRDI QIDQ1155068

James F. Lynch

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(81)90272-7

zbMATH Keywords

configurations of sets

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (2)

Mathematical problems and games ⋮ Enumeration of Full Graphs: Onset of the Asymptotic Region

Cites Work

• An asymptotic formula for the number of classes of sets of n indistinguishable elements
• The number of finite relational structures
• Asymptotic Enumeration of Partial Orders on a Finite Set
• The number of unlabelled graphs with many nodes and edges

This page was built for publication: The visually distinct configurations of k sets