An extremal problem with excluded subposet in the Boolean lattice

DOI10.1023/A:1006051802267zbMath0917.05077MaRDI QIDQ1272945

Hai Tran Thanh

Publication date: 2 August 1999

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

Boolean latticeSperner's theoremforkexcluded subposet

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05)

Related Items (25)

Forbidden induced subposets of given height ⋮ Three layer \(Q _{2}\)-free families in the Boolean lattice ⋮ Set Families With a Forbidden Induced Subposet ⋮ Sperner type theorems with excluded subposets ⋮ Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method) ⋮ No four subsets forming an \(N\) ⋮ Exact forbidden subposet results using chain decompositions of the cycle ⋮ An upper bound on the size of diamond-free families of sets ⋮ The partition method for poset-free families ⋮ Diamond-free subsets in the linear lattices ⋮ Diamond-free families ⋮ Turán problems on non-uniform hypergraphs ⋮ On crown-free families of subsets ⋮ Non \(t\)-intersecting families of linear spaces over \(GF(q)\) ⋮ Set families with forbidden subposets ⋮ On Families of Subsets With a Forbidden Subposet ⋮ Largest families without an \(r\)-fork ⋮ Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\) ⋮ Families of subsets without a given poset in double chains and Boolean lattices ⋮ Forbidding rank-preserving copies of a poset ⋮ On forbidden poset problems in the linear lattice ⋮ A simple proof for a forbidden subposet problem ⋮ VC dimension and a union theorem for set systems ⋮ \(Q _{2}\)-free families in the Boolean lattice ⋮ Abelian groups yield many large families for the diamond problem

This page was built for publication: An extremal problem with excluded subposet in the Boolean lattice