{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:39:15Z","timestamp":1787323155084,"version":"build-2736575974"},"reference-count":19,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2011,1]]},"abstract":"<jats:p>We prove two results on packing common bases of two matroids. First, we show that the computational problem of common base packing reduces to the special case where one of the matroids is a direct sum of uniform matroids. Second, we give a counterexample to a conjecture of Chow, which proposed a sufficient condition for the existence of a common base packing. Chow's conjecture is a generalization of Rota's basis conjecture.<\/jats:p>","DOI":"10.1137\/100815232","type":"journal-article","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T19:09:30Z","timestamp":1323976170000},"page":"1792-1803","source":"Crossref","is-referenced-by-count":7,"title":["On Disjoint Common Bases in Two Matroids"],"prefix":"10.1137","volume":"25","author":[{"given":"Nicholas J. A.","family":"Harvey","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tam\u00e1s","family":"Kir\u00e1ly","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lap Chi","family":"Lau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2011,12,15]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1137\/080723727"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"G. Cornu\u00e9jols,\n                      Combinatorial Optimization: Packing and Covering\n                      , CBMS-NSF Regional Conf. Ser. in Appl. Math. 74, SIAM, Philadelphia, 2001.","DOI":"10.1137\/1.9780898717105"},{"key":"R3","unstructured":"G. Cornu\u00e9jols and B. Guenin,\n                      Tutorial on Ideal Clutters\n                      , http:\/\/rutcor.rutgers.edu\/~do99\/EA\/GCornuejols.ps (1999)."},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011389"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-14.1.55"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.6028\/jres.069B.005"},{"key":"R7","unstructured":"J. Edmonds,\n                      Matroid partition\n                      , in Mathematics of the Decision Sciences Part 1 (Proceedings Fifth Summer Seminar on the Mathematics of the Decision Sciences, Stanford, CA, 1967) Lectures in Appl. Math. 11, G. B. Dantzig and A. F. Veinott, Jr., eds., American Mathematical Society, Providence, RI, 1968, pp. 335\u2013345."},{"key":"R8","unstructured":"J. Edmonds,\n                      Submodular functions, matroids, and certain polyhedra\n                      , in Combinatorial Structures and Their Applications, R. Guy, H. Hanani, N. Sauer, and J. Sch\u00f6nheim, eds., Gordon and Breach, New York, 1970, pp. 69\u201387."},{"key":"R9","unstructured":"J. Edmonds,\n                      Edge-Disjoint Branchings\n                      , in Combinatorial Algorithms, Courant Comput. Sci. Sympos. 9, New York University, New York, 1972, R. Rustin, ed., Algorithmics Press, 1973, pp. 91\u201396."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"J. Edmonds and R. Giles,\n                      A min-max relation for submodular functions on graphs\n                      , in Studies in Integer Programming, Ann. Discrete Math. 1, (Proceedings Workshop on Integer Programming, Bonn, 1975), P. L. Hammer, E. L. Johnson, B. H. Korte, and G. L. Nemhauser, eds., North-Holland, Amsterdam, 1977, pp. 185\u2013204.","DOI":"10.1016\/S0167-5060(08)70734-9"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"A. Frank and \u00c9. Tardos,\n                      Matroids from crossing families\n                      , in Finite and Infinite Sets, Vol. I, (Proceedings Sixth Hungarian Combinatorial Colloquium, Eger, 1981), A. Hajnal, L. Lov\u00e1sz, and V.T. S\u00f3s, eds., Amsterdam, 1984, Colloq. Math. Soc. J. Bolyai, 37, North-Holland, pp. 295\u2013304.","DOI":"10.1016\/B978-0-444-86893-0.50022-X"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/060666494"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)90114-7"},{"key":"R14","first-page":"104","volume":"34","author":"K\u0151nig D.","year":"1916","journal-title":"Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi \u00c9rtesit\u0151"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(76)90049-6"},{"key":"R16","unstructured":"J. G. Oxley,\n                      Matroid Theory\n                      , Oxford University Press, Oxford, UK, 1992."},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90057-6"},{"key":"R18","unstructured":"A. Schrijver,\n                      Combinatorial Optimization: Polyhedra and Efficiency\n                      , Springer, Berlin, New York, 2004."},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(74)90024-6"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/100815232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:44:57Z","timestamp":1787319897000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/100815232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["10.1137\/100815232"],"URL":"https:\/\/doi.org\/10.1137\/100815232","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1]]}}}