pith. sign in

arxiv: 1202.4427 · v1 · pith:A6RPRAI6new · submitted 2012-02-20 · 🧮 math.CO

Counting maximal antichains and independent sets

Liviu Ilinca , Jeff Kahn This is my paper
classification 🧮 math.CO
keywords maximalindependentsetsantichainsasymptoticsn-dimensionalnumbersactual
0
0 comments X
read the original abstract

Answering several questions of Duffus, Frankl and R\"odl, we give asymptotics for the logarithms of (i) the number of maximal antichains in the n-dimensional Boolean algebra and (ii) the numbers of maximal independent sets in the covering graph of the n-dimensional hypercube and certain natural subgraphs thereof. The results in (ii) are implied by more general upper bounds on the numbers of maximal independent sets in regular and biregular graphs. We also mention some stronger possibilities involving actual rather than logarithmic asymptotics.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Finite-n Estimate of Dedekind Numbers by Layer-Ratio Monte Carlo

    math.CO 2026-06 unverdicted novelty 6.0

    Monte Carlo layer-ratio reconstruction via fixed-layer Markov chains produces the estimate M(10) ≈ 8.936 × 10^78 with uncertainty from cross-n scaling calibrated on known smaller values.