Counting unlabeled structures

DOI10.1016/0097-3165(87)90061-6zbMath0618.05029MaRDI 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

asymptotics; enumeration of structures

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

Related Items

Prime orders all of whose prime suborders are selfdual, Order extensions and the fixed point property, Representation of graphs by OBDDs, The computational complexity of asymptotic problems. I: Partial orders, Counting finite posets and topologies, The number of nonisomorphic posets having 12 elements, Perpendicular orders, Automorphisms, isotone self-maps and cycle-free orders

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