Sperner type theorems with excluded subposets

Katona, Gyula (2013) Sperner type theorems with excluded subposets. DISCRETE APPLIED MATHEMATICS, 161 (9). pp. 1251-1258. ISSN 0166-218X

Preview

Text sperner type.pdf Download (277kB) | Preview

Abstract

Let F be a family of subsets of an n-element set. Sperner's theorem says that if there is no inclusion among the members of F then the largest family under this condition is the one containing all ⌊ frac(n, 2) ⌋-element subsets. The present paper surveys certain generalizations of this theorem. The maximum size of F is to be found under the condition that a certain configuration is excluded. The configuration here is always described by inclusions. More formally, let P be a poset. The maximum size of a family F which does not contain P as a (not-necessarily induced) subposet is denoted by La (n, P). The paper is based on a lecture of the author at the Jubilee Conference on Discrete Mathematics [Banasthali University, January 11-13, 2009], but it was somewhat updated in December 2010. © 2011 Elsevier B.V. All rights reserved.

Actions (login required)

Edit Item