{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T21:40:25Z","timestamp":1762033225870},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","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-2953-2","type":"journal-article","created":{"date-parts":[[2014,9,4]],"date-time":"2014-09-04T17:48:48Z","timestamp":1409852928000},"page":"153-180","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Matroid intersection, base packing and base covering for infinite matroids"],"prefix":"10.1007","volume":"35","author":[{"given":"Nathan","family":"Bowler","sequence":"first","affiliation":[]},{"given":"Johannes","family":"Carmesin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,4]]},"reference":[{"key":"2953_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00222-008-0157-3","volume":"176","author":"R. Aharoni","year":"2009","unstructured":"R. Aharoni and E. Berger: Menger\u2019s theorem for infinite graphs, Invent. math. 176 (2009), 1\u201362.","journal-title":"Invent. math."},{"key":"2953_CR2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/jgt.3190130110","volume":"13","author":"R. Aharoni","year":"1989","unstructured":"R. Aharoni and C. Thomassen: Infinite, highly connected digraphs with no two arc-disjoint spanning trees, J. Graph Theory 13 (1989), 71\u201374.","journal-title":"J. Graph Theory"},{"key":"2953_CR3","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1112\/S0024610798006723","volume":"58","author":"R. Aharoni","year":"1998","unstructured":"R. Aharoni and R. Ziv: The intersection of two infinite matroids, J. London Math. Soc. 58 (1998), 513\u2013525.","journal-title":"J. London Math. Soc."},{"key":"2953_CR4","volume-title":"Infinite matroid union","author":"E. Aigner-Horev","year":"2012","unstructured":"E. Aigner-Horev, J. Carmesin and J. Fr\u00f6hlich: Infinite matroid union, preprint 2012, available at http:\/\/arxiv.org\/pdf\/1111.0602v2."},{"key":"2953_CR5","volume-title":"On the intersection of infinite matroids","author":"E. Aigner-Horev","year":"2012","unstructured":"E. Aigner-Horev, J. Carmesin and J. Fr\u00f6hlich: On the intersection of infinite matroids, preprint 2012, available at http:\/\/arxiv.org\/pdf\/1111.0606v2."},{"key":"2953_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1793-8","volume-title":"Basic Topology","author":"M. A. Armstrong","year":"1983","unstructured":"M. A. Armstrong: Basic Topology, Springer-Verlag, 1983."},{"key":"2953_CR7","first-page":"1461","volume":"311","author":"H. Bruhn","year":"2011","unstructured":"H. Bruhn and R. Diestel: Infinite matroids in graphs, Infinite Graph Theory special volume of Discrete Math 311 (2011), 1461\u20131471.","journal-title":"Infinite Graph Theory special volume of Discrete Math"},{"key":"2953_CR8","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.aim.2013.01.011","volume":"239","author":"H. Bruhn","year":"2013","unstructured":"H. Bruhn, R. Diestel, M. Kriesell, R. Pendavingh and P. Wollan: Axioms for infinite matroids, Adv. Math 239 (2013), 18\u201346","journal-title":"Adv. Math"},{"key":"2953_CR9","doi-asserted-by":"crossref","first-page":"1900","DOI":"10.1016\/j.ejc.2012.05.006","volume":"33","author":"H. Bruhn","year":"2012","unstructured":"H. Bruhn and P. Wollan: Finite connectivity in infinite matroids, European J. of Combin. 33 (2012), 1900\u20131912.","journal-title":"European J. of Combin."},{"key":"2953_CR10","volume-title":"Infinite graphs, graph-like spaces, B-matroids","author":"R. Christian","year":"2010","unstructured":"R. Christian: Infinite graphs, graph-like spaces, B-matroids, PhD thesis, University of Waterloo, 2010."},{"key":"2953_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R. Diestel","year":"2010","unstructured":"R. Diestel: Graph Theory (4th edition). Springer-Verlag, 2010. Electronic edition available at: http:\/\/diestel-graph-theory.com\/index.html .","edition":"4th"},{"key":"2953_CR12","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/S0021-9800(67)80077-2","volume":"3","author":"C. S.t. J. A. Nash-Williams","year":"1967","unstructured":"C. St. J. A. Nash-Williams: Infinite graphs\u2014a survey, J. Combin. Theory 3 (1967), 286\u2013301.","journal-title":"J. Combin. Theory"},{"key":"2953_CR13","volume-title":"Matroid Theory","author":"J. Oxley","year":"1992","unstructured":"J. Oxley: Matroid Theory, Oxford University Press, 1992."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2953-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-2953-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2953-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:50Z","timestamp":1559079170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-2953-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,4]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["2953"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-2953-2","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]]}}}