Families of subsets without a given poset in double chains and Boolean lattices

DOI10.1007/S11083-017-9436-1zbMath1406.06003OpenAlexW2753635756MaRDI QIDQ722595

Jun-Yi Guo, Hong-Bin Chen, Wei-Tian Li, Fei-Huang Chang

Publication date: 27 July 2018

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-017-9436-1

zbMATH Keywords

graded posetdouble countingextremal familyinterval chainsposet-free families

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Diamond-free subsets in the linear lattices
• An improvement of the general bound on the largest family of subsets avoiding a subposet
• Diamond-free families
• Exact forbidden subposet results using chain decompositions of the cycle
• An extremal problem with excluded subposet in the Boolean lattice
• An upper bound on the size of diamond-free families of sets
• On diamond-free subposets of the Boolean lattice
• Induced and non-induced forbidden subposet problems
• Poset-free families and Lubell-boundedness
• Set families with a forbidden subposet
• No four subsets forming an \(N\)
• On crown-free families of subsets
• A note on the largest size of families of sets with a forbidden poset
• Largest families without an \(r\)-fork
• Largest family without \(A \cup B \subseteq C \cap D\)
• Reducibility among Combinatorial Problems
• The method of double chains for largest families with excluded subposets
• A short proof of Sperner's lemma
• The complexity of theorem-proving procedures
• A Dual of Dilworth's Decomposition Theorem
• On a lemma of Littlewood and Offord

This page was built for publication: Families of subsets without a given poset in double chains and Boolean lattices