scientific article
From MaRDI portal
Publication:3315539
zbMath0533.05035MaRDI QIDQ3315539
T. G. Tarján, Gyula O. H. Katona
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Intersecting \(P\)-free families ⋮ Forbidden induced subposets of given height ⋮ Almost cross-intersecting and almost cross-Sperner pairs of families of sets ⋮ Largest family without a pair of posets on consecutive levels of the Boolean lattice ⋮ Three layer \(Q _{2}\)-free families in the Boolean lattice ⋮ Schröder partitions, Schröder tableaux and weak poset patterns ⋮ Supersaturation, counting, and randomness in forbidden subposet problems ⋮ On Generalized Turán Results in Height Two Posets ⋮ A note on the size of \(\mathscr{N}\)-free families ⋮ Sperner type theorems with excluded subposets ⋮ Incomparable copies of a poset in the Boolean lattice. ⋮ Packing posets in the Boolean lattice. ⋮ Uniform chain decompositions and applications ⋮ Forbidden subposet problems with size restrictions ⋮ The covering lemma and q-analogues of extremal set theory problems ⋮ On some extremal and probabilistic questions for tree posets ⋮ Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method) ⋮ No four subsets forming an \(N\) ⋮ Sperner's Theorem and a Problem of Erdős, Katona and Kleitman ⋮ Exact forbidden subposet results using chain decompositions of the cycle ⋮ An upper bound on the size of diamond-free families of sets ⋮ Saturated Subgraphs of the Hypercube ⋮ Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems ⋮ The partition method for poset-free families ⋮ Diamond-free families ⋮ Turán problems on non-uniform hypergraphs ⋮ On crown-free families of subsets ⋮ Set families with forbidden subposets ⋮ Supersaturation and stability for forbidden subposet problems. ⋮ Union-intersecting set systems ⋮ An improvement of the general bound on the largest family of subsets avoiding a subposet ⋮ Induced and non-induced forbidden subposet problems ⋮ Forbidden subposet problems for traces of set families ⋮ Families of subsets without a given poset in double chains and Boolean lattices ⋮ Forbidding rank-preserving copies of a poset ⋮ On the number of containments in \(P\)-free families ⋮ On forbidden poset problems in the linear lattice ⋮ A simple proof for a forbidden subposet problem ⋮ Induced and non-induced poset saturation problems ⋮ Forbidden subposet problems in the grid ⋮ \(Q _{2}\)-free families in the Boolean lattice ⋮ Avoiding brooms, forks, and butterflies in the linear lattices ⋮ Generalized forbidden subposet problems ⋮ Poset-free families and Lubell-boundedness ⋮ Abelian groups yield many large families for the diamond problem
