Paper Info
Title
Induced and Non-induced Forbidden Subposet Problems.
Abstract
The problem of determining the maximum size La(n, P) that a P-free subposet of the Boolean lattice B-n can have, attracted the attention of many researchers, but little is known about the induced version of these problems. In this paper we determine the asymptotic behavior of La* (n, P), the maximum size that an induced P-free subposet of the Boolean lattice B-n can have for the case when P is the complete two-level poset K-r,K-t or the complete multi-level poset Kr,(s1),...,(sj,)t when all si's either equal 4 or are large enough and satisfy an extra condition. We also show lower and upper bounds for the non-induced problem in the case when P is the complete three-level poset K-r,K-s,K-t. These bounds determine the asymptotics of La(n, K-r,K-s,K-t) for some values of s independently of the values of r and t.
Year
Venue
Field
2015
ELECTRONIC JOURNAL OF COMBINATORICS
Discrete mathematics,Combinatorics,Boolean algebra (structure),Asymptotic analysis,Partially ordered set,Mathematics
DocType
Volume
Issue
Journal
22.0
1.0
ISSN
Citations 
PageRank 
1077-8926
0
0.34
References 
Authors
5
1
Name
Order
Citations
PageRank
Balázs Patkós18521.60