{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T08:00:52Z","timestamp":1772265652362,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,6,5]],"date-time":"2018-06-05T00:00:00Z","timestamp":1528156800000},"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":["Combinatorica"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s00493-016-3594-4","type":"journal-article","created":{"date-parts":[[2018,6,6]],"date-time":"2018-06-06T06:54:29Z","timestamp":1528268069000},"page":"955-985","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Number of Bases of Almost All Matroids"],"prefix":"10.1007","volume":"38","author":[{"given":"Rudi","family":"Pendavingh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorn","family":"van der Pol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,5]]},"reference":[{"key":"3594_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-Regular Graphs","author":"A. E. Brouwer","year":"1989","unstructured":"A. E. Brouwer, A.M. Cohen and A. Neumaier: Distance-Regular Graphs, volume 18 of Ergebnisse der Mathematik und ihrer Grenzgebiete, Springer Berlin Heidelberg, 1989."},{"key":"3594_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00493-014-3029-z","volume":"35","author":"N. Bansal","year":"2015","unstructured":"N. Bansal, R. A. Pendavingh and J. G. van der Pol: On the number of matroids, Combinatorica 35 (2015), 253\u2013277.","journal-title":"Combinatorica"},{"key":"3594_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0097-3165(86)90019-1","volume":"43","author":"F. R. K. Chung","year":"1986","unstructured":"F. R. K. Chung, R. L. Graham, P. Frankl and J. B. Shearer: Some intersection theorems for ordered sets and graphs, J. Combin. Theory Ser. A 43 (1986), 23\u201337.","journal-title":"J. Combin. Theory Ser. A"},{"key":"3594_CR4","first-page":"149","volume":"202","author":"B. Cloteaux","year":"2010","unstructured":"B. Cloteaux: Approximating the number of bases for almost all matroids, Congressus Numerantium 202 (2010), 149\u2013153.","journal-title":"Congressus Numerantium"},{"key":"3594_CR5","volume-title":"On the foundations of combinatorial theory: Combinatorial geometries","author":"H. H. Crapo","year":"1970","unstructured":"H. H. Crapo and G.-C. Rota: On the foundations of combinatorial theory: Combinatorial geometries, the M.I.T. Press, Cambridge, Mass.-London, preliminary edition, 1970."},{"key":"3594_CR6","volume-title":"Minors of asymptotically almost all sparse paving matroids","author":"W. Critchlow","year":"2016","unstructured":"W. Critchlow: Minors of asymptotically almost all sparse paving matroids, preprint, available on arXiv:1605.02414, 2016."},{"key":"3594_CR7","doi-asserted-by":"crossref","unstructured":"J. Geelen, B. Gerards and G. Whittle: Solving Rota's conjecture, Notices of the AMS 61 (2014).","DOI":"10.1090\/noti1139"},{"key":"3594_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/TIT.1980.1056141","volume":"26","author":"R. L. Graham","year":"1980","unstructured":"R. L. Graham and N. J. A. Sloane: Lower bounds for constant weight codes, IEEE Trans. Inform. Theory 26 (1980), 37\u201343.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3594_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17364-6","volume-title":"Extremal combinatorics: with applications in computer science","author":"S. Jukna","year":"2011","unstructured":"S. Jukna: Extremal combinatorics: with applications in computer science, Springer, 2011."},{"key":"3594_CR10","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1016\/0097-3165(74)90063-6","volume":"16","author":"D. E. Knuth","year":"1974","unstructured":"D. E. Knuth: The asymptotic number of geometries, J. Combin. Theory Ser. A 16 (1974), 398\u2013400.","journal-title":"J. Combin. Theory Ser. A"},{"key":"3594_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0012-365X(82)90204-7","volume":"41","author":"D. J. Kleitman","year":"1982","unstructured":"D. J. Kleitman and K. J. Winston: On the number of graphs without 4-cycles, Discrete Math. 41 (1982), 167\u2013172.","journal-title":"Discrete Math."},{"key":"3594_CR12","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.jctb.2008.12.003","volume":"99","author":"D. Mayhew","year":"2009","unstructured":"D. Mayhew, M. Newman and G. Whittle: On excluded minors for realrepresentability, J. Combin. Theory Ser. B 99 (2009), 685\u2013689.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3594_CR13","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1016\/j.ejc.2011.01.016","volume":"32","author":"D. Mayhew","year":"2011","unstructured":"D. Mayhew, M. Newman, D. Welsh and G. Whittle: On the asymptotic proportion of connected matroids, European J. Combin. 32 (2011), 882\u2013890.","journal-title":"European J. Combin."},{"key":"3594_CR14","volume-title":"Almost all matroids are non-representable","author":"P. Nelson","year":"2016","unstructured":"P. Nelson: Almost all matroids are non-representable, Preprint, avaible on arXiv:1605.04288v2, 2016."},{"key":"3594_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.aam.2011.09.007","volume":"50","author":"J. Oxley","year":"2013","unstructured":"J. Oxley, C. Semple, L. Warshauer and D. Welsh: On properties of almost all matroids, Adv. Appl. Math. 50 (2013), 115\u2013124.","journal-title":"Adv. Appl. Math."},{"key":"3594_CR16","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001","volume-title":"Matroid theory","author":"J. Oxley","year":"2011","unstructured":"J. Oxley: Matroid theory, volume 21 of Oxford Graduate Texts in Mathematics, Oxford University Press, Oxford, second edition, 2011."},{"key":"3594_CR17","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.jctb.2014.10.001","volume":"111","author":"R. Pendavingh","year":"2015","unstructured":"R. Pendavingh and J. van der Pol: Counting matroids in minor-closed classes, J. of Combin. Theory Ser. B 111 (2015), 126\u2013147.","journal-title":"J. of Combin. Theory Ser. B"},{"key":"3594_CR18","doi-asserted-by":"crossref","unstructured":"R. Pendavingh and J. van der Pol: On the number of matroids compared to the number of sparse paving matroids, Electron. J. Combin. 22 (2015), Paper 2.51.","DOI":"10.37236\/4899"},{"key":"3594_CR19","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.ejc.2015.02.005","volume":"48","author":"W. Samotij","year":"2015","unstructured":"W. Samotij: Counting independent sets in graphs, Eur. J. Combin. 48 (2015), 5\u201318.","journal-title":"Eur. J. Combin."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-016-3594-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3594-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3594-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,3]],"date-time":"2020-11-03T04:26:58Z","timestamp":1604377618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-016-3594-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,5]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["3594"],"URL":"https:\/\/doi.org\/10.1007\/s00493-016-3594-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,5]]},"assertion":[{"value":"4 March 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}