{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:43:14Z","timestamp":1740123794632,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T00:00:00Z","timestamp":1563926400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T00:00:00Z","timestamp":1563926400000},"content-version":"vor","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":[[2020,7]]},"DOI":"10.1007\/s11083-019-09501-7","type":"journal-article","created":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T10:55:07Z","timestamp":1563965707000},"page":"223-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Avoiding Brooms, Forks, and Butterflies in the Linear Lattices"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9391-4009","authenticated-orcid":false,"given":"Shahriar","family":"Shahriari","sequence":"first","affiliation":[]},{"given":"Song","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"9501_CR1","volume-title":"Combinatorics of Finite Sets","author":"I Anderson","year":"2002","unstructured":"Anderson, I.: Combinatorics of Finite Sets. Dover Publications, Mineola (2002). Corrected reprint of the 1989 edition published by Oxford University Press, Oxford"},{"issue":"2","key":"9501_CR2","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/S0021-9800(69)80129-8","volume":"6","author":"A Kirby","year":"1969","unstructured":"Kirby, A., Baker, A: generalization of Sperner\u2019s lemma. J. Combinatorial Theory Ser. A 6(2), 224\u2013225 (1969)","journal-title":"J. Combinatorial Theory Ser. A"},{"issue":"2","key":"9501_CR3","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.jcta.2005.01.002","volume":"111","author":"A De Bonis","year":"2005","unstructured":"De Bonis, A, Katona, G.O.H., Swanepoel, K.J.: Largest family without A\u222aB \u2286C\u2229D. J. Combin. Theory Ser. A 111(2), 331\u2013336 (2005)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9501_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574719","volume-title":"Sperner Theory, Encyclopedia of Mathematics","author":"K Engel","year":"1997","unstructured":"Engel, K.: Sperner Theory, Encyclopedia of Mathematics. Cambridge University Press, Cambridge (1997)"},{"key":"9501_CR5","unstructured":"Gerbner, D.: The covering lemma and q-analogues of extremal set theory problems, arXiv:\n1905.06994v2"},{"key":"9501_CR6","doi-asserted-by":"publisher","unstructured":"Gerbner, D, Methuku, A, Nagy, D.T., Patk\u00f3s, B., Vizer, M: Forbidding rank-preserving copies of a poset. Order. \nhttps:\/\/doi.org\/10.1007\/s11083-019-09484-5\n\n(2019)","DOI":"10.1007\/s11083-019-09484-5"},{"key":"9501_CR7","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1137\/0117090","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L., Harper, L.H.: Some results on matching in bipartite graphs. SIAM J. Appl. Math. 17, 1017\u20131022 (1969)","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"9501_CR8","doi-asserted-by":"publisher","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. Combin. Theory Ser. A 119(2), 310\u2013322 (2012)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9501_CR9","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.jcta.2018.01.003","volume":"156","author":"D Gr\u00f3sz","year":"2018","unstructured":"Gr\u00f3sz, D., Methuku, A., Tompkins, C.: An upper bound on the size of diamond-free families of sets. J. Combin. Theory Ser. A 156, 164\u2013194 (2018)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9501_CR10","first-page":"119","volume-title":"Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method), Horizons of Combinatorics, Bolyai Soc. Math. Stud., vol. 17","author":"GOH Katona","year":"2008","unstructured":"Katona, G.O.H.: Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method), Horizons of Combinatorics, Bolyai Soc. Math. Stud., vol. 17, pp 119\u2013140. Springer, Berlin (2008)"},{"key":"9501_CR11","first-page":"84","volume-title":"Extremal Problems with Excluded Subgraphs in the n-Cube, Graph Theory (\u0141ag\u00f3w, 1981), Lecture Notes in Math., vol. 1018","author":"GOH Katona","year":"1983","unstructured":"Katona, G.O.H., Tarj\u00e1n, T.G.: Extremal Problems with Excluded Subgraphs in the n-Cube, Graph Theory (\u0141ag\u00f3w, 1981), Lecture Notes in Math., vol. 1018, pp 84\u201393. Springer, Berlin (1983)"},{"key":"9501_CR12","unstructured":"Kleitman, D.J.: On an extremal property of antichains in partial orders. The LYM property and some of its implications and applications. Combinatorics (Proc. NATO Advanced Study Inst., Breukelen Part 2: Graph theory; foundations, partitions and combinatorial geometry. Math. Centrum, Amsterdam, pp. 77\u201390. Math. Centre Tracts, No. 56 (1974)"},{"issue":"4","key":"9501_CR13","doi-asserted-by":"publisher","first-page":"14","DOI":"10.37236\/4803","volume":"22","author":"A Methuku","year":"2015","unstructured":"Methuku, A., Tompkins, C.: Exact forbidden subposet results using chain decompositions of the cycle. Electron. J. Combin. 22(4), 14 (2015). Paper 4.29","journal-title":"Electron. J. Combin."},{"key":"9501_CR14","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.jcta.2017.10.005","volume":"155","author":"DT Nagy","year":"2018","unstructured":"Nagy, D.T.: Forbidden subposet problems with size restrictions. J. Combin. Theory Ser. A 155, 42\u201366 (2018)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9501_CR15","volume-title":"Forbidden Posets, Undergraduate Thesis","author":"P Salerno","year":"2009","unstructured":"Salerno, P.: Forbidden Posets, Undergraduate Thesis. Pomona College, Claremont (2009)"},{"key":"9501_CR16","doi-asserted-by":"crossref","unstructured":"Sarkis, G, Shahriari, S, PCURC: Diamond-free subsets in the linear lattices, vol. 31. PCURC stands for the Pomona College Undergraduate Research Circle whose members in Spring of 2011 were Zachary Barnett, David Breese, Benjamin Fish, William Frick, Andrew Khatutsky, Daniel McGuinness, Dustin Rodrigues, and Claire Ruberman (English)","DOI":"10.1007\/s11083-013-9310-8"},{"key":"9501_CR17","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E Sperner","year":"1928","unstructured":"Sperner, E: Ein satz \u00fcber Untermengen einer endlichen Mengen. Math. Z. 27, 544\u20138 (1928)","journal-title":"Math. Z."},{"key":"9501_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511987045","volume-title":"A Course in Combinatorics","author":"JH van Lint","year":"2001","unstructured":"van Lint, J.H., Wilson, R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2nd edn."},{"key":"9501_CR19","unstructured":"Xiao, J, Tompkins, C.: On forbidden poset problems in the linear lattice, arXiv:\n1905.09246v1"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-019-09501-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-019-09501-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-019-09501-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T23:06:12Z","timestamp":1595459172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-019-09501-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,24]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["9501"],"URL":"https:\/\/doi.org\/10.1007\/s11083-019-09501-7","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"type":"print","value":"0167-8094"},{"type":"electronic","value":"1572-9273"}],"subject":[],"published":{"date-parts":[[2019,7,24]]},"assertion":[{"value":"6 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}