On forbidden poset problems in the linear lattice

DOI10.37236/8831zbMath1433.06001arXiv1905.09246OpenAlexW3001278634MaRDI QIDQ2290344

Casey Tompkins, Ji Meng Xiao

Publication date: 27 January 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (2)

The covering lemma and q-analogues of extremal set theory problems ⋮ Avoiding brooms, forks, and butterflies in the linear lattices

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
• Avoiding brooms, forks, and butterflies in the linear lattices
• Exact forbidden subposet results using chain decompositions of the cycle
• An extremal problem with excluded subposet in the Boolean lattice
• Shadows and intersections in vector spaces
• A simple proof for a forbidden subposet problem
• 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\)
• The method of double chains for largest families with excluded subposets

This page was built for publication: On forbidden poset problems in the linear lattice