{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:24:13Z","timestamp":1725888253562},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319592497"},{"type":"electronic","value":"9783319592503"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59250-3_1","type":"book-chapter","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T09:04:39Z","timestamp":1495530279000},"page":"1-12","source":"Crossref","is-referenced-by-count":0,"title":["The Two-Point Fano and Ideal Binary Clutters"],"prefix":"10.1007","author":[{"given":"Ahmad","family":"Abdi","sequence":"first","affiliation":[]},{"given":"Bertrand","family":"Guenin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"key":"1_CR1","unstructured":"Abdi, A., Guenin, B.: The minimally non-ideal binary clutters with a triangle (Submitted)"},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1016\/0021-8693(69)90085-4","volume":"13","author":"WG Bridges","year":"1969","unstructured":"Bridges, W.G., Ryser, H.J.: Combinatorial designs and related systems. J. Algebra 13, 432\u2013446 (1969)","journal-title":"J. Algebra"},{"key":"1_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717105","volume-title":"Combinatorial Optimization, Packing and Covering","author":"G Cornu\u00e9jols","year":"2001","unstructured":"Cornu\u00e9jols, G.: Combinatorial Optimization, Packing and Covering. SIAM, Philadelphia (2001)"},{"issue":"3","key":"1_CR4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/S0895480100371389","volume":"15","author":"G Cornu\u00e9jols","year":"2002","unstructured":"Cornu\u00e9jols, G., Guenin, B.: Ideal binary clutters, connectivity, and a conjecture of Seymour. SIAM J. Discrete Math. 15(3), 329\u2013352 (2002)","journal-title":"SIAM J. Discrete Math."},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","volume":"8","author":"J Edmonds","year":"1970","unstructured":"Edmonds, J., Fulkerson, D.R.: Bottleneck extrema. J. Combin. Theory Ser. B 8, 299\u2013306 (1970)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1006\/jctb.2001.2051","volume":"83","author":"B Guenin","year":"2001","unstructured":"Guenin, B.: A characterization of weakly bipartite graphs. J. Combin. Theory Ser. B 83, 112\u2013168 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"4","key":"1_CR8","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1287\/moor.27.4.693.299","volume":"27","author":"B Guenin","year":"2002","unstructured":"Guenin, B.: Integral polyhedra related to even-cycle and even-cut matroids. Math. Oper. Res. 27(4), 693\u2013710 (2002)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1_CR9","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1137\/0112059","volume":"12","author":"A Lehman","year":"1964","unstructured":"Lehman, A.: A solution of the Shannon switching game. Soc. Ind. Appl. Math. 12(4), 687\u2013725 (1964)","journal-title":"Soc. Ind. Appl. Math."},{"issue":"1","key":"1_CR10","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF01588263","volume":"17","author":"A Lehman","year":"1979","unstructured":"Lehman, A.: On the width-length inequality. Math. Program. 17(1), 403\u2013417 (1979)","journal-title":"Math. Program."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Lehman, A.: The width-length inequality and degenerate projective planes. In: DIMACS, vol. 1, pp. 101\u2013105 (1990)","DOI":"10.1090\/dimacs\/001\/10"},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K Menger","year":"1927","unstructured":"Menger, K.: Zur allgemeinen Kurventheorie. Fundamenta Mathematicae 10, 96\u2013115 (1927)","journal-title":"Fundamenta Mathematicae"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-59408-6_53","volume-title":"Integer Programming and Combinatorial Optimization","author":"B Novick","year":"1995","unstructured":"Novick, B., Seb\u0151, A.: On combinatorial properties of binary spaces. In: Balas, E., Clausen, J. (eds.) IPCO 1995. LNCS, vol. 920, pp. 212\u2013227. Springer, Heidelberg (1995). doi: 10.1007\/3-540-59408-6_53"},{"key":"1_CR14","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001","volume-title":"Matroid Theory","author":"J Oxley","year":"2011","unstructured":"Oxley, J.: Matroid Theory, 2nd edn. Oxford University Press, New York (2011)","edition":"2"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Seymour, P.D.: On Lehman\u2019s width-length characterization. In: DIMACS, vol. 1, pp. 107\u2013117 (1990)","DOI":"10.1090\/dimacs\/001\/11"},{"issue":"12","key":"1_CR16","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1112\/jlms\/s2-12.3.356","volume":"2","author":"PD Seymour","year":"1976","unstructured":"Seymour, P.D.: The forbidden minors of binary matrices. J. Lond. Math. Soc. 2(12), 356\u2013360 (1976)","journal-title":"J. Lond. Math. Soc."},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(77)90031-4","volume":"23","author":"PD Seymour","year":"1977","unstructured":"Seymour, P.D.: The matroids with the max-flow min-cut property. J. Combin. Theory Ser. B 23, 189\u2013222 (1977)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59250-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T19:49:41Z","timestamp":1569354581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59250-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592497","9783319592503"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59250-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}