The method of double chains for largest families with excluded subposets

DOI10.5614/ejgta.2013.1.1.4zbMath1306.05239arXiv1204.5355OpenAlexW2085024048MaRDI QIDQ5177020

Péter Burcsi, Dániel T. Nagy

Publication date: 5 March 2015

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

excluded subposetdouble chainLubell's function

Mathematics Subject Classification ID

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

Related Items (17)

Intersecting \(P\)-free families ⋮ Forbidden induced subposets of given height ⋮ Largest family without a pair of posets on consecutive levels of the Boolean lattice ⋮ Forbidden subposet problems with size restrictions ⋮ The covering lemma and q-analogues of extremal set theory problems ⋮ Exact forbidden subposet results using chain decompositions of the cycle ⋮ An upper bound on the size of diamond-free families of sets ⋮ Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems ⋮ A note on the largest size of families of sets with a forbidden poset ⋮ Set families with forbidden subposets ⋮ An improvement of the general bound on the largest family of subsets avoiding a subposet ⋮ Induced and non-induced forbidden subposet problems ⋮ Families of subsets without a given poset in double chains and Boolean lattices ⋮ On forbidden poset problems in the linear lattice ⋮ Forbidden subposet problems in the grid ⋮ Generalized forbidden subposet problems ⋮ Poset-free families and Lubell-boundedness

This page was built for publication: The method of double chains for largest families with excluded subposets