Largest family without a pair of posets on consecutive levels of the Boolean lattice

DOI10.1007/S11083-021-09558-3MaRDI QIDQ2140991zbMATH OpenOpenAlexFDO

Authors Ji Meng Xiao, Gyula O. H. Katona

Publication date 23 May 2022

Published in Order (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

extremal set theoryforbidden subposetsdouble counting

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

Recommendations

• A simple proof for a forbidden subposet problem
• Families of subsets without a given poset in double chains and Boolean lattices
• The method of double chains for largest families with excluded subposets
• A note on the largest size of families of sets with a forbidden poset
• Generalized forbidden subposet problems

Cites work

• scientific article; zbMATH DE number 3427361 (Why is no real title available?)
• scientific article; zbMATH DE number 3845613 (Why is no real title available?)
• A simple proof for a forbidden subposet problem
• An improvement of the general bound on the largest family of subsets avoiding a subposet
• Exact forbidden subposet results using chain decompositions of the cycle
• Forbidding rank-preserving copies of a poset
• Largest family without \(A \cup B \subseteq C \cap D\)
• On a lemma of Littlewood and Offord
• Progress on poset-free families of subsets
• The combinatorics of evenly spaced binomial coefficients
• The method of double chains for largest families with excluded subposets
• Vertex Turán problems for the oriented hypercube

Cited in

(1)

• Largest family without a pair of posets on consecutive levels of the Boolean lattice

This page was built for publication: Largest family without a pair of posets on consecutive levels of the Boolean lattice

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