{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:27Z","timestamp":1720640787274},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s1571-0653(04)00103-9","type":"journal-article","created":{"date-parts":[[2004,10,15]],"date-time":"2004-10-15T15:21:27Z","timestamp":1097853687000},"page":"567-579","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Width and f-vectors of Cutsets in the Truncated Boolean Lattice"],"prefix":"10.1016","volume":"11","author":[{"given":"Shahriar","family":"Shahriari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB1","series-title":"Combinatorics of Finite Sets","author":"Anderson","year":"1989"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB2","first-page":"77","article-title":"On the minimum width of a cutset in the truncated Boolean lattice","volume":"130","author":"Bajnok","year":"1998","journal-title":"Congr. Numer"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB3","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1006\/jcta.1996.0062","article-title":"Long symmetric chains in the Boolean lattice","volume":"75","author":"Bajnok","year":"1996","journal-title":"Journal of Combinatorial Theory A"},{"issue":"1","key":"10.1016\/S1571-0653(04)00103-9_NEWBIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00009834","article-title":"On uniform f-vectors of cutsets in the truncated Boolean lattice","volume":"20","author":"Bajnok","year":"2000","journal-title":"Combinatorica"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB5","unstructured":"T. Banh, E. DuBois, and S. Shahriari. The width of 2-cutsets in the Boolean lattice. in preparation."},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB6","first-page":"191","article-title":"The integrity of the cube is small","volume":"9","author":"Beineke","year":"1991","journal-title":"J. Combin. Math. Combin. Comput"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB7","doi-asserted-by":"crossref","unstructured":"G. F. Clements. Errata to: Antichains in the set of subsets of a multiset, discrete math. 48 (1984) 23\u201345. unpublished.","DOI":"10.1016\/0012-365X(84)90128-6"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0012-365X(84)90128-6","article-title":"Antichains in the set of subsets of a multiset","volume":"48","author":"Clements","year":"1984","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB9","series-title":"The Combinatorics of Network Reliability","author":"Colbourn","year":"1987"},{"issue":"2","key":"10.1016\/S1571-0653(04)00103-9_NEWBIB10","first-page":"84","article-title":"Antichains in the lattice of subsets of a finite set","volume":"8","author":"Daykin","year":"1975","journal-title":"Nanta Math"},{"issue":"2","key":"10.1016\/S1571-0653(04)00103-9_NEWBIB11","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1137\/0403017","article-title":"Maximal chains and antichains in the Boolean lattices","volume":"3","author":"Duffus","year":"1990","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0012-365X(93)90327-P","article-title":"Packing lines in a hypercube","volume":"117","author":"Felzenbaum","year":"1993","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0097-3165(95)90110-8","article-title":"Minimum shadows in uniform hypergraphs and a generalization of the Takagi function","volume":"69","author":"Frankl","year":"1995","journal-title":"Journal of Combinatorial Theory A"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB14","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01788687","article-title":"A minimum cutset of the Boolean lattice with almost all members","volume":"5","author":"F\u00fcredi","year":"1989","journal-title":"Graphs and Combinatorics"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB15","unstructured":"C. Greene and D. J. Kleitman. Proof techniques in the theory of finite sets. In G.-C. Rota, editor, Studies in Combinatorics, volume 17 of MAA studies in Mathematics, pages 22\u201379. The Mathematical Association of America, 1978."},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB16","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(94)00284-P","article-title":"Matchings, cutsets, and chain partitions in graded posets","volume":"114","author":"Griggs","year":"1995","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB17","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF00341634","article-title":"Minimum cutsets for an element of a Boolean lattice","volume":"6","author":"Griggs","year":"1989","journal-title":"Order"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB18","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1006038020498","article-title":"Games of chains and cutsets in the Boolean lattice","volume":"14","author":"Gutterman","year":"1998","journal-title":"Order"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB19","unstructured":"M. Haines and S. Shahriari. On the f-vectors of cutsets in the Boolean lattice. to appear in Journal of Combinatorial Theory Part A."},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB20","series-title":"Theory of Graphs. Proc. Colloq. Tihany","first-page":"187","article-title":"A theorem on finite sets","author":"Katona","year":"1966"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB21","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0012-365X(86)90013-0","article-title":"On a problem of Yuzvinsky on separating the n-cube","volume":"60","author":"Kleitman","year":"1986","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB22","series-title":"Extremal Problems for Finite Sets","first-page":"355","article-title":"Extermal problems of hypergraphs","author":"Kleitman","year":"1994"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB23","series-title":"Mathermatical optimization techniques","first-page":"251","article-title":"The number of simplices in a complex","author":"Kruskal","year":"1963"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB24","unstructured":"D. L. Li and S. Shahriari. Chains and cutsets in the Boolean lattice. in preparation."},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB25","unstructured":"P. L. Mariz and S. Shahriari. Edge cutsets in the Boolean lattice. submitted."},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB26","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0012-365X(87)90011-2","article-title":"Cutsets of Boolean lattices","volume":"63","author":"Nowakowski","year":"1987","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S1571-0653(04)00103-9_NEWBIB27","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(93)90010-Q","article-title":"The density of a maximum minimal cut in the subset lattice of a finite set is almost one","volume":"123","author":"Shi","year":"1993","journal-title":"Discrete Mathematics"},{"issue":"4","key":"10.1016\/S1571-0653(04)00103-9_NEWBIB28","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1109\/71.273045","article-title":"Improved lower bounds on the reliability of hypercube architetures","volume":"5","author":"Soh","year":"1994","journal-title":"IEEE Transactions on Parallel and Distributed Systems"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304001039?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304001039?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T15:41:49Z","timestamp":1682782909000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304001039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":28,"alternative-id":["S1571065304001039"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00103-9","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}