Largest family without a pair of posets on consecutive levels of the Boolean lattice
From MaRDI portal
Publication:2140991
DOI10.1007/S11083-021-09558-3OpenAlexW3136419803MaRDI QIDQ2140991FDOQ2140991
Authors: Ji Meng Xiao, Gyula O. H. Katona 
Publication date: 23 May 2022
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.08238
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
- On a lemma of Littlewood and Offord
- Largest family without \(A \cup B \subseteq C \cap D\)
- Title not available (Why is that?)
- 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
- Exact forbidden subposet results using chain decompositions of the cycle
- Progress on poset-free families of subsets
- Forbidding rank-preserving copies of a poset
- Vertex Turán problems for the oriented hypercube
- Title not available (Why is that?)
- A simple proof for a forbidden subposet problem
- The combinatorics of evenly spaced binomial coefficients
Cited In (1)
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)
