{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:22:47Z","timestamp":1758824567464},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,10,26]],"date-time":"2015-10-26T00:00:00Z","timestamp":1445817600000},"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":["Discrete Comput Geom"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s00454-015-9735-5","type":"journal-article","created":{"date-parts":[[2015,10,26]],"date-time":"2015-10-26T14:39:57Z","timestamp":1445870397000},"page":"954-979","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Many 2-Level Polytopes from Matroids"],"prefix":"10.1007","volume":"54","author":[{"given":"Francesco","family":"Grande","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juanjo","family":"Ru\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,26]]},"reference":[{"key":"9735_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107325913","volume-title":"Combinatorial Species and Tree-like Structures","author":"F Bergeron","year":"1997","unstructured":"Bergeron, F., Labelle, G., Leroux, P., Readdy, M.: Combinatorial Species and Tree-like Structures. Cambridge University Press, Cambridge (1997)"},{"issue":"8","key":"9735_CR2","doi-asserted-by":"crossref","first-page":"2091","DOI":"10.1016\/j.ejc.2007.04.011","volume":"28","author":"M Bodirsky","year":"2007","unstructured":"Bodirsky, M., Gim\u00e9nez, O., Kang, M., Noy, M.: Enumeration and limit laws for series-parallel graphs. Eur. J. Comb. 28(8), 2091\u20132105 (2007)","journal-title":"Eur. J. Comb."},{"key":"9735_CR3","series-title":"Progress in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-2066-4","volume-title":"Coxeter Matroids","author":"AV Borovik","year":"2003","unstructured":"Borovik, A.V., Gel\u2019fand, I.M., White, N.: Coxeter Matroids. Progress in Mathematics, vol. 216. Birkh\u00e4user Boston, Boston (2003)"},{"issue":"3","key":"9735_CR4","doi-asserted-by":"crossref","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","volume":"32","author":"WH Cunningham","year":"1980","unstructured":"Cunningham, W.H., Edmonds, J.: A combinatorial decomposition theory. Can. J. Math. 32(3), 734\u2013765 (1980)","journal-title":"Can. J. Math."},{"key":"9735_CR5","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-12971-1","volume-title":"Triangulations","author":"JA Loera De","year":"2010","unstructured":"De Loera, J.A., Rambau, J., Santos, F.: Triangulations. Algorithms and Computation in Mathematics, vol. 25. Springer, Berlin (2010)"},{"issue":"1\u20132","key":"9735_CR6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<103::AID-RSA5>3.3.CO;2-0","volume":"10","author":"M Drmota","year":"1997","unstructured":"Drmota, M.: Systems of functional equations. Random Struct. Algorithms 10(1\u20132), 103\u2013124 (1997)","journal-title":"Random Struct. Algorithms"},{"key":"9735_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-211-75357-6","volume-title":"Random Trees","author":"M Drmota","year":"2009","unstructured":"Drmota, M.: Random Trees. Springer, Wien, NewYork, Vienna (2009)"},{"issue":"4","key":"9735_CR8","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1137\/100790161","volume":"25","author":"M Drmota","year":"2011","unstructured":"Drmota, M., Fusy, \u00c9., Kang, M., Kraus, V., Ru\u00e9, J.: Asymptotic study of subcritical graph classes. SIAM J. Discrete Math. 25(4), 1615\u20131651 (2011)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"9735_CR9","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0403019","volume":"3","author":"P Flajolet","year":"1990","unstructured":"Flajolet, P., Odlyzko, A.: Singularity analysis of generating functions. SIAM J. Discrete Math. 3(2), 216\u2013240 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"9735_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic Combinatorics","author":"P Flajolet","year":"2009","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)"},{"key":"9735_CR11","doi-asserted-by":"crossref","unstructured":"Freij, R., Henze, M., Schmitt, M.W., Ziegler, G.M.: Face numbers of centrally symmetric polytopes produced from split graphs. Electron. J. Combin. 20(2):Paper 32, 15, (2013)","DOI":"10.37236\/3315"},{"issue":"3","key":"9735_CR12","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0001-8708(87)90059-4","volume":"63","author":"IM Gelfand","year":"1987","unstructured":"Gelfand, I.M., Goresky, M., MacPherson, R.D., Serganova, V.V.: Combinatorial geometries, convex polyhedra, and Schubert cells. Adv. Math. 63(3), 301\u2013316 (1987)","journal-title":"Adv. Math."},{"issue":"4","key":"9735_CR13","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1137\/090746525","volume":"20","author":"J Gouveia","year":"2010","unstructured":"Gouveia, J., Parrilo, P.A., Thomas, R.R.: Theta bodies for polynomial ideals. SIAM J. Optim. 20(4), 2097\u20132118 (2010)","journal-title":"SIAM J. Optim."},{"key":"9735_CR14","unstructured":"Grande, F., Sanyal, R.: Theta rank, levelness, and matroids minors. arXiv:1408.1262v2 (2015)"},{"key":"9735_CR15","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, vol. 2, 2nd edn. Springer, Berlin (1993)","edition":"2"},{"key":"9735_CR16","doi-asserted-by":"crossref","first-page":"65","DOI":"10.7146\/math.scand.a-10456","volume":"4","author":"O Hanner","year":"1956","unstructured":"Hanner, O.: Intersections of translates of convex bodies. Math. Scand. 4, 65\u201387 (1956)","journal-title":"Math. Scand."},{"issue":"2","key":"9735_CR17","doi-asserted-by":"crossref","first-page":"225","DOI":"10.7146\/math.scand.a-11716","volume":"41","author":"AB Hansen","year":"1977","unstructured":"Hansen, A.B.: On a certain class of polytopes associated with independence systems. Math. Scand. 41(2), 225\u2013241 (1977)","journal-title":"Math. Scand."},{"key":"9735_CR18","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Emerging Applications of Algebraic Geometry. IMA Volumes in Mathematics and Its Applications, vol. 149, pp. 157\u2013270. Springer, New York (2009)","DOI":"10.1007\/978-0-387-09686-5_7"},{"issue":"4","key":"9735_CR19","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0012-365X(76)90067-4","volume":"14","author":"P McMullen","year":"1976","unstructured":"McMullen, P.: Constructions for projectively unique polytopes. Discrete Math. 14(4), 347\u2013358 (1976)","journal-title":"Discrete Math."},{"key":"9735_CR20","series-title":"Oxford Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001","volume-title":"Matroid Theory","author":"J Oxley","year":"2011","unstructured":"Oxley, J.: Matroid Theory. Oxford Graduate Texts in Mathematics, vol. 21, 2nd edn. Oxford University Press, Oxford (2011)","edition":"2"},{"issue":"2","key":"9735_CR21","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s00454-008-9104-8","volume":"41","author":"R Sanyal","year":"2009","unstructured":"Sanyal, R., Werner, A., Ziegler, G.M.: On Kalai\u2019s conjectures concerning centrally symmetric polytopes. Discrete Comput. Geom. 41(2), 183\u2013198 (2009)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"9735_CR22","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02187680","volume":"1","author":"RP Stanley","year":"1986","unstructured":"Stanley, R.P.: Two poset polytopes. Discrete Comput. Geom. 1(1), 9\u201323 (1986)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"9735_CR23","doi-asserted-by":"crossref","first-page":"433","DOI":"10.2748\/tmj\/1163775139","volume":"58","author":"S Sullivant","year":"2006","unstructured":"Sullivant, S.: Compressed polytopes and statistical disclosure limitation. Tohoku Math. J. 58(3), 433\u2013445 (2006)","journal-title":"Tohoku Math. J."},{"key":"9735_CR24","series-title":"Encyclopedia of Mathematics and Its Applications","volume-title":"Graph Theory","author":"WT Tutte","year":"2001","unstructured":"Tutte, W.T.: Graph Theory. Encyclopedia of Mathematics and Its Applications, vol. 21. Cambridge University Press, Cambridge (2001)"},{"key":"9735_CR25","series-title":"Encyclopedia of Mathematics and Its Applications","volume-title":"Theory of Matroids","year":"1986","unstructured":"White, N. (ed.): Theory of Matroids. Encyclopedia of Mathematics and Its Applications, vol. 26. Cambridge University Press, Cambridge (1986)"},{"key":"9735_CR26","doi-asserted-by":"crossref","unstructured":"Ziegler, G.M.: Lectures on $$0\/1$$ 0 \/ 1 -polytopes. In: Polytopes\u2014Combinatorics and Computation (Oberwolfach, 1997). DMV Sem., vol. 29, pp. 1\u201341. Birkh\u00e4user, Basel (2000)","DOI":"10.1007\/978-3-0348-8438-9_1"},{"key":"9735_CR27","unstructured":"Ziegler, G.M.: Convex polytopes: example and conjectures. Doc course combinatorics and geometry 2009. Discrete Comput. Geom. CRM Documents 5.1(3):9\u201349 (2010)"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-015-9735-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-015-9735-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-015-9735-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T09:03:03Z","timestamp":1599728583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-015-9735-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,26]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["9735"],"URL":"https:\/\/doi.org\/10.1007\/s00454-015-9735-5","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,26]]}}}