{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T20:54:03Z","timestamp":1656622443336},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,1,6]],"date-time":"2015-01-06T00:00:00Z","timestamp":1420502400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s11083-014-9343-7","type":"journal-article","created":{"date-parts":[[2015,1,5]],"date-time":"2015-01-05T04:32:51Z","timestamp":1420432371000},"page":"429-438","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Packing Posets in the Boolean Lattice"],"prefix":"10.1007","volume":"32","author":[{"given":"Andrew P.","family":"Dove","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerrold R.","family":"Griggs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,6]]},"reference":[{"key":"9343_CR1","volume-title":"Modern Combinatorics (Japanese)","author":"J Akiyama","year":"1987","unstructured":"Akiyama, J., Frankl, P.: Modern Combinatorics (Japanese). Kyoritsu, Tokyo (1987)"},{"key":"9343_CR2","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/BF01904851","volume":"16","author":"B Bollob\u00e1s","year":"1965","unstructured":"Bollob\u00e1s, B.: On generalized graphs. Acta Math. Acad. Sci. Hungar. 16, 447\u2013452 (1965)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"9343_CR3","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.jcta.2011.09.002","volume":"119","author":"JR Griggs","year":"2012","unstructured":"Griggs, J.R., Li, W.-T., Lu, L.: Diamond-free Families. J. Comb. Theory (Ser. A) 119, 310\u2013322 (2012)","journal-title":"J. Combinatorial Theory (Ser. A)"},{"key":"9343_CR4","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/0097-3165(84)90085-2","volume":"36","author":"JR Griggs","year":"1984","unstructured":"Griggs, J.R., Stahl, J., Trotter, W.T.: Jr., A Sperner Theorem on Unrelated Chains of Subsets. J. Comb. Theory (Ser. A) 36, 124\u2013127 (1984)","journal-title":"J. Combinatorial Theory (Ser. A)"},{"key":"9343_CR5","volume-title":"On the maximum number of incomparable copies of a given poset in a family of subsets, Lecture, International Conference on Recent Trends in Graph Theory and Combinatorics","author":"GOH Katona","year":"2010","unstructured":"Katona, G.O.H.: On the maximum number of incomparable copies of a given poset in a family of subsets, Lecture, International Conference on Recent Trends in Graph Theory and Combinatorics. Cochin University of Science and Technology, India (2010)"},{"key":"9343_CR6","doi-asserted-by":"crossref","unstructured":"Katona, G.O.H., Nagy, D.T.: Incomparable Copies of a Poset in the Boolean Lattice. Order. (2015). doi: 10.1007\/s11083-014-9342-8","DOI":"10.1007\/s11083-014-9342-8"},{"key":"9343_CR7","volume-title":"Graph Theory, \u0141ag\u00f3w, 1981, vol. 1018 Lecture Notes in Math., pp. 84\u201393","author":"GOH Katona","year":"1983","unstructured":"Katona, G.O.H., Tarj\u00e1n, T.G.: Extremal problems with excluded subgraphs in the n-cube. In: Borowiecki, M., Kennedy, J. W., Sys\u0142o, M.M. (eds.) Graph Theory, \u0141ag\u00f3w, 1981, vol. 1018 Lecture Notes in Math., pp. 84\u201393. Springer, Berlin Heidelberg (1983)"},{"key":"9343_CR8","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.jcta.2012.11.002","volume":"120","author":"L Kramer","year":"2012","unstructured":"Kramer, L., Martin, R.R., Young, M.: On diamond-free subposets of the Boolean lattice. J. Comb. Theory (Ser. A) 120, 545\u2013560 (2012)","journal-title":"J. Combinatorial Theory (Ser. A)"},{"key":"9343_CR9","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0021-9800(66)80035-2","volume":"1","author":"D Lubell","year":"1966","unstructured":"Lubell, D.: A short proof of Sperner\u2019s lemma. J. Comb. Theory 1, 299 (1966)","journal-title":"J. Combin. Theory"},{"key":"9343_CR10","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E Sperner","year":"1928","unstructured":"Sperner, E.: Ein Satz \u00fcber Untermegen einer endlichen Menge. Math. Z. 27, 544\u2013548 (1928)","journal-title":"Math. Z."}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-014-9343-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-014-9343-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-014-9343-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:12:16Z","timestamp":1559365936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-014-9343-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,6]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["9343"],"URL":"https:\/\/doi.org\/10.1007\/s11083-014-9343-7","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,6]]}}}