On diamond-free subposets of the Boolean lattice

DOI10.1016/j.jcta.2012.11.002zbMath1345.05112arXiv1205.1501OpenAlexW2007473634MaRDI QIDQ1940370

Yanyan Li

Publication date: 6 March 2013

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

extremal set theoryforbidden subposetsflag algebrasdiamond-free subposets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05)

Related Items

Forbidden induced subposets of given height, Incomparable copies of a poset in the Boolean lattice., Packing posets in the Boolean lattice., A LYM inequality for induced posets, 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, Turán problems on non-uniform hypergraphs, On crown-free families of subsets, Set families with forbidden subposets, Boolean algebras and Lubell functions, Families of subsets without a given poset in double chains and Boolean lattices, Ramsey numbers for partially-ordered sets, Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube, Poset-free families and Lubell-boundedness, Abelian groups yield many large families for the diamond problem