Set families with a forbidden subposet (Q2380308)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5686845
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Set families with a forbidden subposet |
scientific article; zbMATH DE number 5686845 |
Statements
Set families with a forbidden subposet (English)
0 references
26 March 2010
0 references
Summary: We asymptotically determine the size of the largest family \(\mathcal F\) of subsets of \(\{1,\cdots, n\}\) not containing a given poset \(P\) if the Hasse diagram of \(P\) is a tree. This is a qualitative generalization of several known results including Sperner's theorem.
0 references
0.9363674521446228
0 references
0.8631344437599182
0 references
0.8621395826339722
0 references
0.8613930344581604
0 references
0.8456783890724182
0 references
