Progress on poset-free families of subsets
From MaRDI portal
Publication:2957186
DOI10.1007/978-3-319-24298-9_14zbMath1354.05138OpenAlexW2502085572MaRDI QIDQ2957186
Wei-Tian Li, Jerrold R. Griggs
Publication date: 25 January 2017
Published in: Recent Trends in Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-24298-9_14
Related Items
Largest family without a pair of posets on consecutive levels of the Boolean lattice, On Generalized Turán Results in Height Two Posets, Minimum weight flat antichains of subsets, A note on the size of \(\mathscr{N}\)-free families, Vertex Turán problems for the oriented hypercube, Improved bounds for induced poset saturation, The covering lemma and q-analogues of extremal set theory problems, SATURATION FOR THE BUTTERFLY POSET, The induced saturation problem for posets, An upper bound on the size of diamond-free families of sets, The Boolean rainbow Ramsey number of antichains, Boolean posets and chains, The saturation number of induced subposets of the Boolean lattice, Forbidding rank-preserving copies of a poset, A simple proof for a forbidden subposet problem, Induced and non-induced poset saturation problems, Existence thresholds and Ramsey properties of random posets, On colorings of the Boolean lattice avoiding a rainbow copy of a poset, Forbidden subposet problems in the grid, Generalized forbidden subposet problems
