Set families with a forbidden subposet (Q2380308): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0803.3840 / rank | |||
Normal rank | |||
Revision as of 05:12, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Set families with a forbidden subposet |
scientific article |
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
