Forbidden subposet problems with size restrictions
Combinatorics
2016-08-25 v1
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.
Cite
@article{arxiv.1608.06646,
title = {Forbidden subposet problems with size restrictions},
author = {Dániel T. Nagy},
journal= {arXiv preprint arXiv:1608.06646},
year = {2016}
}
Comments
19 pages