scientific article; zbMATH DE number 3786783
From MaRDI portal
Publication:3964569
antichainchainDilworth theoremfinite extremal set theoryFortuin-Kastelyn-Ginibre inequalityincomparable subsetsSperner theorem
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Permutations, words, matrices (05A05) Combinatorial identities, bijective combinatorics (05A19) Research exposition (monographs, survey articles) pertaining to ordered structures (06-02) Partial orders, general (06A06) Classical equilibrium statistical mechanics (general) (82B05)
Cited in
(16)- Recognition of order-preserving maps
- Some sequences associated with combinatorial structures
- About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets
- On multiset k-families
- A new result on Chvátal's conjecture
- Extreme \(k\)-families
- Some greedy t-intersecting families of finite sequences
- On families of finite sets with bounds on unions and intersections
- Matchings, cutsets, and chain partitions in graded posets
- Erdös–Ko–Rado Theorem—22 Years Later
- On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
- Hamiltonian cycles and symmetric chains in Boolean lattices.
- Combinatorics in the exterior algebra and the Bollobás two families theorem
- On the lattice of maximum-sized antichains of a finite poset
- Improved bounds for cross-Sperner systems
- Some remarks on normalized matching
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964569)
