{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T01:40:44Z","timestamp":1768873244713,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,9,4]],"date-time":"2014-09-04T00:00:00Z","timestamp":1409788800000},"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":[[2015,4]]},"DOI":"10.1007\/s00493-014-3029-z","type":"journal-article","created":{"date-parts":[[2014,9,4]],"date-time":"2014-09-04T21:49:03Z","timestamp":1409867343000},"page":"253-277","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["On the number of matroids"],"prefix":"10.1007","volume":"35","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[]},{"given":"Rudi A.","family":"Pendavingh","sequence":"additional","affiliation":[]},{"given":"Jorn G.","family":"van der Pol","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,4]]},"reference":[{"key":"3029_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0012-365X(88)90189-6","volume":"72","author":"N. Alon","year":"1988","unstructured":"N. Alon and F. R. K. Chung: Explicit construction of linear sized tolerant networks, Discrete Math. 72 (1988), 15\u201319.","journal-title":"Discrete Math."},{"key":"3029_CR2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s11856-013-0067-y","volume":"199","author":"N. Alon","year":"2014","unstructured":"N. Alon, J. Balogh, R. Morris and W. Samotij: Counting sum-free sets in Abelian groups, Israel Journal of Mathematics 199 (2014), 309\u2013344.","journal-title":"Israel Journal of Mathematics"},{"key":"3029_CR3","volume-title":"The probabilistic method, Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"N. Alon","year":"2008","unstructured":"N. Alon and J. H. Spencer: The probabilistic method, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons Inc., Hoboken, NJ, third edition, 2008, with an appendix on the life and work of Paul Erd\u0151s.","edition":"third"},{"key":"3029_CR4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1090\/S0025-5718-1973-0419270-0","volume":"27","author":"J. E. Blackburn","year":"1973","unstructured":"J. E. Blackburn, H. H. Crapo and D. A. Higgs: A catalogue of combinatorial geometries, Math. Comp., 27:155\u2013166; addendum, ibid. 27 (1973), no. 121, loose microfiche suppl. A12\u2013G12, 1973.","journal-title":"Math. Comp."},{"key":"3029_CR5","volume-title":"Sparse paving matroids, basis-exchange properties, and cyclic flats","author":"J. E. Bonin","year":"2011","unstructured":"J. E. Bonin: Sparse paving matroids, basis-exchange properties, and cyclic flats, arXiv:1011.1010v1, 2011."},{"key":"3029_CR6","doi-asserted-by":"crossref","first-page":"417","DOI":"10.3934\/amc.2011.5.417","volume":"5","author":"A. E. Brouwer","year":"2011","unstructured":"A. E. Brouwer and T. Etzion: Some new constant weight codes, Advances in Mathematics of Communications 5 (2011), 417\u2013424.","journal-title":"Advances in Mathematics of Communications"},{"key":"3029_CR7","doi-asserted-by":"crossref","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, Springer, 1989."},{"key":"3029_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-1939-6","volume-title":"Spectra of graphs","author":"A. E. Brouwer","year":"2012","unstructured":"A. E. Brouwer and W. H. Haemers: Spectra of graphs, Universitext. Springer, New York, 2012."},{"key":"3029_CR9","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.","edition":"preliminary"},{"issue":"4","key":"3029_CR10","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1137\/060655596","volume":"20","author":"J. Geelen","year":"2006","unstructured":"J. Geelen and P. J. Humphries: Rota\u2019s basis conjecture for paving matroids, SIAM J. Discrete Math., 20(4):1042\u20131045 (electronic), 2006.","journal-title":"SIAM J. Discrete Math."},{"key":"3029_CR11","doi-asserted-by":"crossref","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":"3029_CR12","volume-title":"Eigenvalue techniques in design and graph theory, volume 121 of Mathematical Centre Tracts","author":"W. H. Haemers","year":"1980","unstructured":"W. H. Haemers: Eigenvalue techniques in design and graph theory, volume 121 of Mathematical Centre Tracts, Mathematisch Centrum, Amsterdam, 1980. Dissertation, Technische Hogeschool Eindhoven, Eindhoven, 1979."},{"key":"3029_CR13","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1007\/s00493-006-0039-5","volume":"26","author":"M. Jerrum","year":"2006","unstructured":"M. Jerrum: Two remarks concerning balanced matroids, Combinatorica 26 (2006), 733\u2013742.","journal-title":"Combinatorica"},{"key":"3029_CR14","doi-asserted-by":"crossref","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":"3029_CR15","doi-asserted-by":"crossref","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. Combinatorial Theory Ser. A 16 (1974), 398\u2013400.","journal-title":"J. Combinatorial Theory Ser. A"},{"key":"3029_CR16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S1570-7954(96)80009-X","volume-title":"Handbook of algebra","author":"J. P. S. Kung","year":"1996","unstructured":"J. P. S. Kung: Matroids, in: Handbook of algebra, Vol. 1, 157\u2013184. North-Holland, Amsterdam, 1996.","edition":"1"},{"key":"3029_CR17","doi-asserted-by":"crossref","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":"3029_CR18","volume-title":"Is the missing axiom of matroid theory lost forever","author":"D. Mayhew","year":"2012","unstructured":"D. Mayhew, M. Newman and G. Whittle: Is the missing axiom of matroid theory lost forever?, arXiv:1204.3365, 2012."},{"key":"3029_CR19","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.jctb.2007.07.005","volume":"98","author":"D. Mayhew","year":"2008","unstructured":"D. Mayhew and G. F. Royle: Matroids with nine elements, J. Combin. Theory Ser. B 98 (2008), 415\u2013431.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3029_CR20","volume-title":"On the number of sparse paving matroids","author":"D. Mayhew","year":"2010","unstructured":"D. Mayhew and D. Welsh: On the number of sparse paving matroids, http:\/\/homepages.ecs.vuw.ac.nz\/~mayhew\/Publications\/MW.pdf, 2010."},{"key":"3029_CR21","doi-asserted-by":"crossref","first-page":"1787","DOI":"10.1016\/j.ejc.2012.04.002","volume":"33","author":"C. Merino","year":"2012","unstructured":"C. Merino, S. D. Noble, M. Ram\u00edrez-Ib\u00e1\u00f1ez and R. V.-Flores: On the structure of the h-vector of a paving matroid, Eur. J. Comb. 33 (2012), 1787\u20131799.","journal-title":"Eur. J. Comb."},{"key":"3029_CR22","volume-title":"Matroid theory, volume 21 of Oxford Graduate Texts in Mathematics","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.","edition":"second"},{"key":"3029_CR23","volume-title":"Counting matroids in minor-closed classes","author":"R. A. Pendavingh","year":"2013","unstructured":"R. A. Pendavingh and J. G. van der Pol: Counting matroids in minor-closed classes, arXiv:1302.1315v3, 2013."},{"key":"3029_CR24","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0095-8956(73)90006-3","volume":"14","author":"M. J. Piff","year":"1973","unstructured":"M. J. Piff: An upper bound for the number of matroids, J. Combinatorial Theory Ser. B 14 (1973), 241\u2013245.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"3029_CR25","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1112\/blms\/3.1.55","volume":"3","author":"M. J. Piff","year":"1971","unstructured":"M. J. Piff and D. J. A. Welsh: The number of combinatorial geometries, Bull. London Math. Soc. 3 (1971), 55\u201356.","journal-title":"Bull. London Math. Soc."},{"key":"3029_CR26","volume-title":"Combinatorial optimization. Polyhedra and efficiency. Vol. B, volume 24 of Algorithms and Combinatorics","author":"A. Schrijver","year":"2003","unstructured":"A. Schrijver: Combinatorial optimization. Polyhedra and efficiency. Vol. B, volume 24 of Algorithms and Combinatorics, Springer-Verlag, Berlin, 2003. Matroids, trees, stable sets, Chapters 39\u201369."},{"key":"3029_CR27","volume-title":"Matroid theory","author":"D. J. A. Welsh","year":"1976","unstructured":"D. J. A. Welsh: Matroid theory, Academic Press [Harcourt Brace Jovanovich Publishers], London, 1976. L. M. S. Monographs, No. 8."},{"key":"3029_CR28","doi-asserted-by":"crossref","first-page":"509","DOI":"10.2307\/2371182","volume":"57","author":"H. Whitney","year":"1935","unstructured":"H. Whitney: On the Abstract Properties of Linear Dependence, Amer. J. Math. 57 (1935), 509\u2013533.","journal-title":"Amer. J. Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3029-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-3029-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3029-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T17:24:09Z","timestamp":1565803449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-3029-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,4]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["3029"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-3029-z","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,4]]}}}