The t-intersection problem in the truncated Boolean lattice
From MaRDI portal
(Redirected from Publication:1864563)
The \(t\)-intersection problem in the truncated Boolean lattice
The \(t\)-intersection problem in the truncated Boolean lattice
Recommendations
- Intersection problems in the Boolean lattice
- On uniform \(f\)-vectors of cutsets in the truncated Boolean lattice
- On the Minimum Width of a Cutset in the Truncated Boolean Lattice
- An extremal problem with excluded subposet in the Boolean lattice
- Non-trivial \(t\)-intersection in the function lattice
- Intersecting families in a subset of Boolean lattices
- On the \(f\)-vectors of cutsets in the Boolean lattice
- scientific article; zbMATH DE number 1047728
- On Intersecting Chains in Boolean Algebras
- Incomparability and intersection properties of Boolean interval lattices and chain posets
Cites work
- A pushing-pulling method: New proofs of intersection theorems
- An Erdős-Ko-Rado theorem for integer sequences of given rank
- Asymptotic Methods in Enumeration
- scientific article; zbMATH DE number 46666 (Why is no real title available?)
- scientific article; zbMATH DE number 1016362 (Why is no real title available?)
- scientific article; zbMATH DE number 863493 (Why is no real title available?)
- scientific article; zbMATH DE number 1420979 (Why is no real title available?)
- Intersection theorems for systems of finite sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On families of finite sets with bounds on unions and intersections
- The complete intersection theorem for systems of finite sets
- The diametric theorem in Hamming spaces---optimal anticodes
- The proof of a conjecture of G. O. H. Katona
Cited in
(2)
This page was built for publication: The \(t\)-intersection problem in the truncated Boolean lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864563)
