{"title":"包装理论","authors":"David A. Klarner","doi":"10.1016/S0021-9800(70)80080-1","DOIUrl":null,"url":null,"abstract":"<div><p>Let <em>A</em> be a set and let <span><math><mi>A</mi></math></span> be a collection of subsets of <em>A</em>. Conditions are given that must hold if a partition of <em>A</em> is a subset of <span><math><mi>A</mi></math></span>. The main idea presented is a generalization of several methods that have been used to prove certain packing theorems.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"8 3","pages":"Pages 272-278"},"PeriodicalIF":0.0000,"publicationDate":"1970-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80080-1","citationCount":"4","resultStr":"{\"title\":\"A packing theory\",\"authors\":\"David A. Klarner\",\"doi\":\"10.1016/S0021-9800(70)80080-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Let <em>A</em> be a set and let <span><math><mi>A</mi></math></span> be a collection of subsets of <em>A</em>. Conditions are given that must hold if a partition of <em>A</em> is a subset of <span><math><mi>A</mi></math></span>. The main idea presented is a generalization of several methods that have been used to prove certain packing theorems.</p></div>\",\"PeriodicalId\":100765,\"journal\":{\"name\":\"Journal of Combinatorial Theory\",\"volume\":\"8 3\",\"pages\":\"Pages 272-278\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1970-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80080-1\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021980070800801\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980070800801","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Let A be a set and let be a collection of subsets of A. Conditions are given that must hold if a partition of A is a subset of . The main idea presented is a generalization of several methods that have been used to prove certain packing theorems.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
