Counting unlabeled structures

DOI10.1016/0097-3165(87)90061-6zbMath0618.05029OpenAlexW2084131533MaRDI QIDQ1089001

Hans Jürgen Prömel

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(87)90061-6

zbMATH Keywords

asymptoticsenumeration of structures

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (11)

Perpendicular orders ⋮ Automorphisms, isotone self-maps and cycle-free orders ⋮ The computational complexity of asymptotic problems. I: Partial orders ⋮ Prime orders all of whose prime suborders are selfdual ⋮ Counting finite posets and topologies ⋮ An initial study of time complexity in infinite-domain constraint satisfaction ⋮ Order extensions and the fixed point property ⋮ Structure and enumeration of \((3+1)\)-free posets ⋮ The automorphism conjecture for ordered sets of dimension 2 and interval orders ⋮ Representation of graphs by OBDDs ⋮ The number of nonisomorphic posets having 12 elements

Cites Work

• A logical approach to asymptotic combinatorics I. First order properties
• The number of finite relational structures
• Model theory
• Kombinatorische Anzahlbestimmungen in Relationen
• Graphs on unlabelled nodes with a given number of edges
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. III
• Asymptotic enumeration and a 0-1 law for $m$-clique free graphs
• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• Countable Ultrahomogeneous Undirected Graphs
• Asymptotic Enumeration of Partial Orders on a Finite Set
• Probabilities on finite models
• Unnamed Item

This page was built for publication: Counting unlabeled structures