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

DOI10.1007/S11083-017-9436-1MaRDI QIDQ722595zbMATH OpenOpenAlexFDO

Authors Junyi Guo, Hongbin 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) Structure theory of lattices (06B05) Extremal set theory (05D05)

Recommendations

• A note on the largest size of families of sets with a forbidden poset
• The method of double chains for largest families with excluded subposets
• An improvement of the general bound on the largest family of subsets avoiding a subposet
• Set families with forbidden subposets
• On families of subsets with a forbidden subposet

Cites work

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

Cited in

(9)

• A note on the largest size of families of sets with a forbidden poset
• Largest family without a pair of posets on consecutive levels of the Boolean lattice
• The method of double chains for largest families with excluded subposets
• Families in posets minimizing the number of comparable pairs
• A simple proof for a forbidden subposet problem
• Forbidden induced subposets of given height
• Families of chains of a poset and Sperner properties
• Poset-free families and Lubell-boundedness
• An improvement of the general bound on the largest family of subsets avoiding a subposet

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

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