{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T23:25:17Z","timestamp":1782861917251,"version":"3.54.5"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We asymptotically determine the size of the largest family $\\cal F$ of subsets of $\\{1,\\dots,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.<\/jats:p>","DOI":"10.37236\/231","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T23:23:41Z","timestamp":1578698621000},"source":"Crossref","is-referenced-by-count":38,"title":["Set Families with a Forbidden Subposet"],"prefix":"10.37236","volume":"16","author":[{"given":"Boris","family":"Bukh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"23455","published-online":{"date-parts":[[2009,11,30]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v16i1r142\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v16i1r142\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T19:03:51Z","timestamp":1579287831000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v16i1r142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,30]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2009,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/231","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,30]]},"article-number":"R142"}}