Three layer Q _2-free families in the Boolean lattice

DOI10.1007/S11083-012-9263-3zbMATH Open1282.06008arXiv1108.4373OpenAlexW1972409259MaRDI QIDQ2376901FDOQ2376901

J. Shen, Jacob Manske

Publication date: 26 June 2013

Published in: Order (Search for Journal in Brave)

Abstract: We prove that the largest $Q_2$-free family of subsets of $[n]$ which contains sets of at most three different sizes has at most $(3+2sqrt3)N/3+o(N)approx2.1547N+o(N)$ members, where $N=nchooselfloorn/2floor$. This improves an earlier bound of $2.207N+o(N)$ by Axenovich, Manske, and Martin.

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

zbMATH Keywords

order theoryBoolean latticeforbidden subposets

Mathematics Subject Classification ID

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

Cites Work

• On a lemma of Littlewood and Offord
• Strong versions of Sperner's theorem
• An extremal problem with excluded subposet in the Boolean lattice
• Set families with a forbidden subposet
• No four subsets forming an \(N\)
• Largest families without an \(r\)-fork
• Largest family without \(A \cup B \subseteq C \cap D\)
• Title not available (Why is that?)
• On Families of Subsets With a Forbidden Subposet
• Diamond-free families
• \(Q _{2}\)-free families in the Boolean lattice
• The partition method for poset-free families

Cited In (7)

• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• Abelian groups yield many large families for the diamond problem
• On the maximum size of \((p,Q)\)-free families
• Turán problems on non-uniform hypergraphs
• Exact forbidden subposet results using chain decompositions of the cycle
• An upper bound on the size of diamond-free families of sets
• Diamond-free subsets in the linear lattices

This page was built for publication: Three layer \(Q _{2}\)-free families in the Boolean lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376901)