Families of Subsets Without a Given Poset in Double Chains and Boolean Lattices

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Given a finite poset P, the intensively studied quantity La(n, P) denotes the largest size of a family of subsets of [n] not containing P as a weak subposet. Burcsi and Nagy (J. Graph Theory Appl. 1, 40–49 2013) proposed a double-chain method to get an upper bound La(n,P)≤12(|P|+h−2)(n⌊n/2⌋) for any finite poset P of height h. This paper elaborates their double-chain method to obtain a new upper boundLa(n,P)≤(|P|+h−α(GP)−22)(n⌊n2⌋)for any graded poset P, where α(GP) denotes the independence number of an auxiliary graph defined in terms of P. This result enables us to find more posets which verify an important conjecture by Griggs and Lu (J. Comb. Theory (Ser. A) 119, 310–322, 2012).

Original languageEnglish
Pages (from-to)349-362
Number of pages14
Issue number2
Publication statusPublished - 2018 Jul 1


  • Double counting
  • Extremal family
  • Graded poset
  • Interval chains
  • Poset-free families

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Geometry and Topology
  • Computational Theory and Mathematics


Dive into the research topics of 'Families of Subsets Without a Given Poset in Double Chains and Boolean Lattices'. Together they form a unique fingerprint.

Cite this