The method of double chains for largest families with excluded subposets
For a given finite poset $P$, $La(n,P)$ denotes the largest size of a family $\mathcal{F}$ of subsets of $[n]$ not containing $P$ as a weak subposet. We exactly determine $La(n,P)$ for infinitely many $P$ posets. These posets are built from seven base posets using two operations. For arbitrary pose...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2013-04-01
|
| Schriftenreihe: | Electronic Journal of Graph Theory and Applications |
| Schlagworte: | |
| Online-Zugang: | http://www.ejgta.org/index.php/ejgta/article/view/17 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|