Asymptotic Enumeration of Partial Orders on a Finite Set
From MaRDI portal
Publication:4055647
DOI10.2307/1997200zbMath0302.05007OpenAlexW4244242684MaRDI QIDQ4055647
Bruce L. Rothschild, Daniel J. Kleitman
Publication date: 1975
Full work available at URL: https://doi.org/10.2307/1997200
Related Items
Path integral suppression of badly behaved causal sets, A verified algorithm enumerating event structures, On some complexity properties of N-free posets and posets with bounded decomposition diameter, Asymptotic enumeration and a 0-1 law for $m$-clique free graphs, FPT algorithms to enumerate and count acyclic and totally cyclic orientations, Excluding induced subgraphs: quadrilaterals, Counting unlabeled structures, The dimension of random ordered sets, Partial order complementation graphs, Causal message sequence charts, A new approach for embedding causal sets into Minkowski space, On the Boolean dimension of spherical orders, Interval number of special posets and random posets, Succinct posets, A logical approach to asymptotic combinatorics I. First order properties, The number of partial orders of fixed width, The average number of linear extensions of a partial order, Almost all Berge Graphs are Perfect, The computational complexity of asymptotic problems. I: Partial orders, Searching in random partially ordered sets, Uniform random posets, Asymptotic enumeration of two-dimensional posets, Introduction to causal sets and their phenomenology, Approximating the number of linear extensions, Spacetime entanglement entropy: covariance and discreteness, Dimension and dimensional reduction in quantum gravity, Necessary and possible indifferences, On the axiomatisability of priority. III: Priority strikes again, Idempotent Boolean matrices, Causal set generator and action computer, On the cardinality of future worldlines in discrete spacetime structures, Sorting probability for large Young diagrams, Scaling limits for width two partially ordered sets: the incomparability window, On the cardinalities of finite topologies and the number of antichains in partially ordered sets, The visually distinct configurations of k sets, Asymptotic enumeration of N-free partial orders, On String Graph Limits and the Structure of a Typical String Graph, Height counting of unlabeled interval and \(N\)-free posets., String graphs and incomparability graphs, Enumeration of Full Graphs: Onset of the Asymptotic Region, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Random orders of dimension 2, New results from an algorithm for counting posets, Diagnosis from scenarios, On the Number of 2-SAT Functions, Counting finite posets and topologies, Towards coarse graining of discrete Lorentzian quantum gravity, Finite size scaling in 2d causal set quantum gravity, Discrete spacetime: a web of chains, On the structure of clique-free graphs, Dimensionally restricted causal set quantum gravity: examples in two and three dimensions, A criterion for covariance in complex sequential growth models, On the number of nondismantlable posets with the fixed point property, The structure of covtree: searching for manifestly covariant causal set dynamics, Manifold properties from causal sets using chains, Entropy and the link action in the causal set path-sum, Boundary contributions in the causal set action, A tale of two actions a variational principle for two-dimensional causal sets, Sublattices of product spaces: Hulls, representations and counting, The asymptotic number of graphs not containing a fixed color-critical subgraph, Almost every 2-SAT function is unate, The causal set approach to quantum gravity, Obtainable sizes of topologies on finite sets, Structure and enumeration of \((3+1)\)-free posets, Phase transitions in the evolution of partial orders, Locally complete path independent choice functions and their lattices, Residuated lattices of size \(\leq 12\), Pictures from Mongolia. Extracting the top elements from a partially ordered set, Algebras defined from ordered sets and the varieties they generate, The gold partition conjecture, Linear extensions and comparable pairs in partial orders, DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS, Existence thresholds and Ramsey properties of random posets, More examples on ordered set reconstruction, Boolean layer cakes, Limit laws and automorphism groups of random nonrigid structures, The Ising model coupled to 2d orders, On the probability that finite spaces with random distances are metric spaces, Periodicity of residues of the number of finite labeled topologies, Forbidden induced partial orders, Almost all comparability graphs are UPO, Random orders, Enumerating orientations of ordered sets, Simple structures axiomatized by almost sure theories, Linear extensions of random orders, Generic theories as a method for approximating elementary theories, The number of 2-SAT functions
Cites Work
