{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T22:44:13Z","timestamp":1768344253384,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540558088","type":"print"},{"value":"9783540472919","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55808-x_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:46:44Z","timestamp":1330249604000},"page":"37-49","source":"Crossref","is-referenced-by-count":5,"title":["On the expansion of combinatorial polytopes"],"prefix":"10.1007","author":[{"given":"Milena","family":"Mihail","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/0403039","volume":"3","author":"D. Aldous","year":"1990","unstructured":"D. Aldous, \u201cThe random walk construction for spanning trees and uniform labeled trees,\u201d SIAM J. of Disc. Math. 3, 1990, pp450\u2013465.","journal-title":"SIAM J. of Disc. Math."},{"issue":"2","key":"4_CR2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02579166","volume":"6","author":"N. Alon","year":"1986","unstructured":"N. Alon, \u201cEigenvalues and Expanders\u201d, Combinatorial 6 (2), 1986, pp 83\u201396.","journal-title":"Combinatorial"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"A.Z. Broder, \u201cHow hard is it to marry at random? (On the approximation of the permanent),\u201d STOC 1986, pp 50\u201358.","DOI":"10.1145\/12130.12136"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"A.Z. Broder, \u201cGenerating random spanning trees,\u201d FOCS 1989, pp 442\u2013447.","DOI":"10.1109\/SFCS.1989.63516"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1215\/S0012-7094-40-00718-9","volume":"7","author":"R.L. Brooks","year":"1940","unstructured":"R.L. Brooks, C.A.B. Smith, A.H. Stone, and W.T. Tutte, \u201cThe dissection of rectangles into squares,\u201d Duke Math. J. 7, 1940, 312\u2013340.","journal-title":"Duke Math. J."},{"key":"4_CR6","unstructured":"P. Dagum and M. Luby, \u201cApproximating the permanent of graphs with large factors\u201d, Siam Journal on Computing, to appear."},{"key":"4_CR7","unstructured":"M. Dyer and A. Frieze, \u201cRandom walks on unimodular zonotopes\u201d, LCPO 1992, Carnegie Mellon."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"M. Dyer, A. Frieze, and R. Kannan, \u201cA random polynomial time algorithm for estimating volumes of convex bodies,\u201d STOC 1989, pp 375\u2013381.","DOI":"10.1145\/73007.73043"},{"key":"4_CR9","first-page":"125","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cMaximum Matching and a Polyhedron with 0,1-Vertices\u201d, JOURNAL OF RESEARCH of the National Bureau of Standards-B. Mathematics and Mathematical Physics Vol 69B, 1965, pp 125\u2013130.","journal-title":"JOURNAL OF RESEARCH of the National Bureau of Standards-B. Mathematics and Mathematical Physics"},{"key":"4_CR10","unstructured":"J. Edmonds, \u201cSubmodular functions, matroids and certain polyhedra,\u201d Combinatorial structures and their applications, Proceedings Calgary International Conference, 1969"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"T. Feder and M. Mihail, \u201cBalanced Matroids\u201d, STOC 1992, pp 26\u201338.","DOI":"10.1145\/129712.129716"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"C. Holtzmann, and F. Harary, On the tree graph of a matroid, SIAM J. Applied Math. 25, pp 187\u2013193.","DOI":"10.1137\/0122021"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"M.R. Jerrum and A. Sinclair, \u201cConductance and the rapid mixing property for Markov chains: the approximation of the permanent resolved,\u201d STOC 1988, pp 235\u2013243.","DOI":"10.1145\/62212.62234"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"M.R. Jerrum","year":"1986","unstructured":"M.R. Jerrum, L.G. Valiant, and V.V. Vazirani, \u201cRandom generation of combinatorial structures from a uniform distribution,\u201d Theoretical Computer Science 43, 1986, pp 169\u2013188.","journal-title":"Theoretical Computer Science"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz and M. Simonovis, \u201cThe mixing rate of M arkov chains, An isoperimetric inequality, and computing the volume,\u201d FOCS 1990, pp 346\u2013354.","DOI":"10.1109\/FSCS.1990.89553"},{"key":"4_CR16","unstructured":"M. Mihail and M. Sudan, \u201cConnectivity properties of matroids\u201d, TR-89, U.C. Berkeley."},{"key":"4_CR17","unstructured":"M. Mihail, and U. Vazirani, \u201cOn the expansion of 0\u20131 polytopes,\u201d Journal of Combinatorial Theory, Series B, to appear."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/0095-8956(84)90040-6","volume":"37","author":"D. Naddef","year":"1984","unstructured":"D. Naddef, \u201cPancyclic Properties of the Graph of Some 0\u20131 Polyhedra\u201d, Journal of Combinatorial Theory, Series B 37, pp 10\u201326, 1984.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0095-8956(84)90043-1","volume":"37","author":"D. Naddef","year":"1984","unstructured":"D. Naddef and W. Pulleyblank, \u201cHamiltonicity in 0\u20131 polyhedra,\u201d Journal of Combinatorial Theory, Series B 37, 1984, pp 41\u201352.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1017\/S0305004100051306","volume":"77","author":"P. Seymour","year":"1975","unstructured":"P. Seymour and D.J.A. Welsh, \u201cCombinatorial applications of an inequality from statistical mechanics,\u201d Math. Proc. Camb. Phil. Soc. 1975, 77, pp 485\u2013495.","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"4_CR21","unstructured":"P. Seymour, M. Sudan, and P. Winkler, personal communication."},{"key":"4_CR22","unstructured":"A. Sinclair and M.E. Jerrum, \u201cApproximate counting, uniform generation and rapidly mixing Markov chains,\u201d Information and Computing, to appear."},{"key":"4_CR23","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02591887","volume":"30","author":"D.M. Topkis","year":"1984","unstructured":"D.M. Topkis, \u201cAdjacency on Polymatroids\u201d, Mathematical Programming 30, 1984, pp 229\u2013237.","journal-title":"Mathematical Programming"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"L.G. Valiant, \u201cThe complexity of enumeration and reliability problems,\u201d SIAM Journal on Computing 8, 1979, pp 410\u2013421.","journal-title":"SIAM Journal on Computing"},{"key":"4_CR25","unstructured":"D. Welsh, Matroid Theory, Academic Press, 1976."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1992"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55808-X_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:29:50Z","timestamp":1742592590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55808-X_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540558088","9783540472919"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-55808-x_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]}}}