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

DOI10.1007/s11083-021-09558-3OpenAlexW3136419803MaRDI QIDQ2140991

Gyula O. H. Katona, Ji Meng Xiao

Publication date: 23 May 2022

Published in: Order (Search for Journal in Brave)

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A simple proof for a forbidden subposet problem
• Largest family without \(A \cup B \subseteq C \cap D\)
• Vertex Turán problems for the oriented hypercube
• Progress on poset-free families of subsets
• The method of double chains for largest families with excluded subposets
• On a lemma of Littlewood and Offord

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