On Families of Subsets With a Forbidden Subposet

From MaRDI portal
Publication:3552501

DOI10.1017/S096354830999037XzbMath1215.05082arXiv0807.3702OpenAlexW2120695274MaRDI QIDQ3552501

Linyuan Lu, Jerrold R. Griggs

Publication date: 22 April 2010

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0807.3702




Related Items (35)

Forbidden induced subposets of given heightThree layer \(Q _{2}\)-free families in the Boolean latticeSet Families With a Forbidden Induced SubposetSchröder partitions, Schröder tableaux and weak poset patternsSupersaturation, counting, and randomness in forbidden subposet problemsSperner type theorems with excluded subposetsIncomparable copies of a poset in the Boolean lattice.Uniform chain decompositions and applicationsForbidden subposet problems with size restrictionsPoset Ramsey numbers: large Boolean lattice versus a fixed posetThe covering lemma and q-analogues of extremal set theory problemsOn some extremal and probabilistic questions for tree posetsAn extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applicationsAn upper bound on the size of diamond-free families of setsForbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet ProblemsThe partition method for poset-free familiesDiamond-free subsets in the linear latticesDiamond-free familiesTurán problems on non-uniform hypergraphsOn crown-free families of subsetsSet families with forbidden subposetsBoolean algebras and Lubell functionsSupersaturation and stability for forbidden subposet problems.Induced and non-induced forbidden subposet problemsForbidden subposet problems for traces of set familiesForbidding rank-preserving copies of a posetRamsey numbers for partially-ordered setsSome Motzkin-Straus type results for non-uniform hypergraphsA simple proof for a forbidden subposet problemInduced and non-induced poset saturation problemsForbidden subposet problems in the grid\(Q _{2}\)-free families in the Boolean latticeRainbow Ramsey problems for the Boolean latticePoset-free families and Lubell-boundednessAbelian groups yield many large families for the diamond problem



Cites Work


This page was built for publication: On Families of Subsets With a Forbidden Subposet