Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-10T18:52:05.668Z Has data issue: false hasContentIssue false

Set Families With a Forbidden Induced Subposet

Published online by Cambridge University Press:  22 March 2012

EDWARD BOEHNLEIN
Affiliation:
Department of Mathematics, Miami University, Oxford, OH 45056, USA (e-mail: boehnlei@math.sc.edu, jiangt@muohio.edu)
TAO JIANG
Affiliation:
Department of Mathematics, Miami University, Oxford, OH 45056, USA (e-mail: boehnlei@math.sc.edu, jiangt@muohio.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For each poset H whose Hasse diagram is a tree of height k, we show that the largest size of a family of subsets of [n]={1,. . ., n} not containing H as an induced subposet is asymptotic to $(k - 1)(\scriptsize{\begin{array}{c}{n}\\[-1.5pt] {\fl{n/2}} \end{array}})$. This extends a result of Bukh [1], which in turn generalizes several known results including Sperner's theorem.

Information

Type
Paper
Copyright
Copyright © Cambridge University Press 2012