The Asymptotic Number of Lattices
From MaRDI portal
Publication:3890742
DOI10.1016/S0167-5060(08)70708-8zbMath0446.06005OpenAlexW1555293549MaRDI QIDQ3890742
Kenneth J. Winston, Daniel J. Kleitman
Publication date: 1980
Published in: Combinatorial Mathematics, Optimal Designs and Their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70708-8
Structure theory of lattices (06B05) Arithmetic functions; related numbers; inversion formulas (11A25)
Related Items (24)
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent ⋮ SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY ⋮ On the maximum number of integer colourings with forbidden monochromatic sums ⋮ A data structure for lattice representation ⋮ On a question of Vera T. Sós about size forcing of graphons ⋮ Applications of graph containers in the Boolean lattice ⋮ Uniform chain decompositions and applications ⋮ Approximately counting independent sets in bipartite graphs via graph containers ⋮ On the number of high‐dimensional partitions ⋮ Extremal problems in hypergraph colourings ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ On the number of graphs without 4-cycles ⋮ Exponential lower bounds of lattice counts by vertical sum and 2-sum ⋮ Counting finite posets and topologies ⋮ On the number of \(r\)-matchings in a tree ⋮ Posets Dismantlable by Doubly Irreducibles ⋮ Residuated lattices of size \(\leq 12\) ⋮ Generating modular lattices of up to 30 elements ⋮ Constructing unlabelled lattices ⋮ Generating all finite modular lattices of a given size ⋮ Counting graded lattices of rank 3 that have few coatoms ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Counting independent sets in graphs
This page was built for publication: The Asymptotic Number of Lattices
