Counting unlabeled structures

DOI10.1016/0097-3165(87)90061-6MaRDI QIDQ1089001zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Counting unlabeled \(k\)-trees
• Finding the description of structure by counting method: a case study
• On Labeled and Unlabeled Combinatorial Structures
• Counting unbranched subgraphs
• scientific article; zbMATH DE number 1504592
• Statistical mechanics of unsupervised structure recognition
• Boltzmann sampling of unlabelled structures
• An unbiased pointing operator for unlabeled structures, with applications to counting and sampling
• Simulating the component counts of combinatorial structures
• Counting unrooted maps using tree-decomposition

Cites work

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

Cited in

(15)

• Order extensions and the fixed point property
• The number of nonisomorphic posets having 12 elements
• The automorphism conjecture for ordered sets of dimension 2 and interval orders
• Limit laws and automorphism groups of random nonrigid structures
• Structure and enumeration of \((3+1)\)-free posets
• The computational complexity of asymptotic problems. I: Partial orders
• Perpendicular orders
• scientific article; zbMATH DE number 3914328 (Why is no real title available?)
• Counting finite posets and topologies
• Prime orders all of whose prime suborders are selfdual
• Representation of graphs by OBDDs
• Automorphisms, isotone self-maps and cycle-free orders
• The ultra-weak Ash conjecture and some particular cases
• Aspects of asymptotic graph theory
• An initial study of time complexity in infinite-domain constraint satisfaction

This page was built for publication: Counting unlabeled structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089001)