No four subsets forming an \(N\)
From MaRDI portal
Publication:2427561
DOI10.1016/j.jcta.2007.05.011zbMath1170.05056OpenAlexW2156839380MaRDI QIDQ2427561
Jerrold R. Griggs, Gyula O. H. Katona
Publication date: 13 May 2008
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2007.05.011
Related Items
Three layer \(Q _{2}\)-free families in the Boolean lattice, A note on the size of \(\mathscr{N}\)-free families, Sperner type theorems with excluded subposets, Poset Ramsey numbers: large Boolean lattice versus a fixed poset, Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method), An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications, 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, Catalan pairs: a relational-theoretic approach to Catalan numbers, Diamond-free subsets in the linear lattices, Diamond-free families, Turán problems on non-uniform hypergraphs, A note on the largest size of families of sets with a forbidden poset, Set families with forbidden subposets, On Families of Subsets With a Forbidden Subposet, Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\), An improvement of the general bound on the largest family of subsets avoiding a subposet, Families of subsets without a given poset in double chains and Boolean lattices, Some Motzkin-Straus type results for non-uniform hypergraphs, \(l\)-trace \(k\)-Sperner families of sets, \(Q _{2}\)-free families in the Boolean lattice, Poset-free families and Lubell-boundedness, Abelian groups yield many large families for the diamond problem
Cites Work
