Forbidden subposet problems with size restrictions
From MaRDI portal
Abstract: Upper bounds to the size of a family of subsets of an n-element set that avoids certain configurations are proved. These forbidden configurations can be described by inclusion patterns and some sets having the same size. Our results are closely related to the forbidden subposet problems, where the avoided configurations are described solely by inclusions.
Recommendations
- Generalized forbidden subposet problems
- Forbidden subposet problems in the grid
- Induced and non-induced forbidden subposet problems
- Forbidden subposet problems for traces of set families
- A simple proof for a forbidden subposet problem
- On families of subsets with a forbidden subposet
- Supersaturation, counting, and randomness in forbidden subposet problems
- Forbidden induced subposets of given height
- Forbidden subgraphs and bounds on the size of a maximum matching
- Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
Cites work
- A note on the largest size of families of sets with a forbidden poset
- A short proof of Sperner's lemma
- An improvement of the general bound on the largest family of subsets avoiding a subposet
- An upper bound on the size of diamond-free families of sets
- Diamond-free families
- Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
- scientific article; zbMATH DE number 3845613 (Why is no real title available?)
- scientific article; zbMATH DE number 15500 (Why is no real title available?)
- Induced and non-induced forbidden subposet problems
- Largest families without an \(r\)-fork
- Largest family without A B C D
- On families of subsets with a forbidden subposet
- Poset-free families and Lubell-boundedness
- Set families with a forbidden induced subposet
- Set families with a forbidden subposet
- The method of double chains for largest families with excluded subposets
- The partition method for poset-free families
Cited in
(6)- Forbidding rank-preserving copies of a poset
- No four subsets forming an \(N\)
- Supersaturation, counting, and randomness in forbidden subposet problems
- Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
- Chain-dependent conditions in extremal set theory
- Avoiding brooms, forks, and butterflies in the linear lattices
This page was built for publication: Forbidden subposet problems with size restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689034)
