Forbidden subposet problems with size restrictions
classification
🧮 math.CO
keywords
configurationsforbiddensizedescribedproblemssubposetavoidedavoids
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.