{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:36Z","timestamp":1781305056840,"version":"3.54.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032286901","type":"print"},{"value":"9783032286918","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-28691-8_10","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:35:54Z","timestamp":1781303754000},"page":"144-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Local Dyadic Conjecture"],"prefix":"10.1007","author":[{"given":"Mahtab","family":"Alghasi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bertrand","family":"Guenin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Levent","family":"Tun\u00e7el","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"2445","DOI":"10.1137\/21M1445260","volume":"36","author":"A Abdi","year":"2022","unstructured":"Abdi, A., Cornu\u00e9jols, G., Palion, Z.: On dyadic fractional packings of $$T$$-joins. SIAM J. Disc. Math. 36(3), 2445\u20132451 (2022)","journal-title":"SIAM J. Disc. Math."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10107-024-02146-4","volume":"213","author":"A Abdi","year":"2025","unstructured":"Abdi, A., Cornu\u00e9jols, G., Guenin, B., Tun\u00e7el, L.: Dyadic linear programming and extensions. Math. Program. 213, 473\u2013516 (2025)","journal-title":"Math. Program."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-023-01967-z","volume":"206","author":"A Abdi","year":"2024","unstructured":"Abdi, A., Cornu\u00e9jols, G., Guenin, B., Tun\u00e7el, L.: Total dual dyadicness and dyadic generating sets. Math. Program. 206, 125\u2013143 (2024)","journal-title":"Math. Program."},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Abdi, A., Cornu\u00e9jols, G., Liu, S., Silina, O.: Strongly connected orientations and integer lattices. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 1\u201314. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-93112-3_1","DOI":"10.1007\/978-3-031-93112-3_1"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: On certain polytopes associated with graphs. J. Comb. Theory Ser. B 18, 138\u2013154 (1975)","journal-title":"J. Comb. Theory Ser. B"},{"key":"10_CR6","unstructured":"Cornu\u00e9jols, G., Karahalios, A., Patil, V.: Computing a Nonnegative Dyadic Solution to a System of Linear Equations. Manuscript, Tepper School of Business, Carnegie Mellon University (2025)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Cornu\u00e9jols, G.: Combinatorial optimization: Packing and covering. Society for Industrial and Applied Mathematics (2001)","DOI":"10.1137\/1.9780898717105"},{"key":"10_CR8","doi-asserted-by":"publisher","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. Comb. Theory 8, 299\u2013306 (1970)","journal-title":"Comb. Theory"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jctb.2002.2128","volume":"86","author":"JF Geelen","year":"2002","unstructured":"Geelen, J.F., Guenin, B.: Packing odd-circuits in Eulerian graphs. J. Comb. Theory B 86, 280\u2013295 (2002)","journal-title":"J. Comb. Theory B"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10107-023-01944-6","volume":"202","author":"B Guenin","year":"2023","unstructured":"Guenin, B., Heo, C.: Recognizing even-cycle and even-cut matroids. Math. Program. 202, 515\u2013542 (2023)","journal-title":"Math. Program."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"B. Guenin, B., Hwang, S.: Dyadic packing of dijoins. SIAM J. Disc. Math. 39, 593\u2013606 (2025)","DOI":"10.1137\/24M1647692"},{"key":"10_CR12","unstructured":"Guenin, B., Tun\u00e7el, L.: Generalizations of Total Dual Integrality. arXiv preprint arXiv:2503.07925 (2025)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1137\/0112059","volume":"12","author":"A Lehman","year":"1964","unstructured":"Lehman, A.: A solution of the Shannon switching game. J. Soc. Ind. Appl. Math. 12, 687\u2013725 (1964)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"17","author":"CL Lucchesi","year":"1978","unstructured":"Lucchesi, C.L., Younger, D.H.: A minimax theorem for directed graphs. J. Lond. Math. Soc. 17(3), 369\u2013374 (1978)","journal-title":"J. Lond. Math. Soc."},{"key":"10_CR15","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). https:\/\/doi.org\/10.1007\/3-540-59408-6_53"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF02579220","volume":"4","author":"JG Oxley","year":"1984","unstructured":"Oxley, J.G.: On the intersections of circuits and cocircuits in matroids. Combinatorica 4, 187\u2013195 (1984)","journal-title":"Combinatorica"},{"key":"10_CR17","unstructured":"Pivotto, I.: Even cycle and even cut matroids. Doctoral dissertation, University of Waterloo (2011)"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational analysis. Grundlehren Math. Wiss., 317 [Fundamental Principles of Mathematical Sciences]. Springer, Berlin (1998)","DOI":"10.1007\/978-3-642-02431-3"},{"key":"10_CR19","unstructured":"Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency. Vol. C, vol. 24, C of Algorithms and Combinatorics. Springer, Berlin (2003). Disjoint paths, hypergraphs, Chapters 70\u201383"},{"key":"10_CR20","unstructured":"Seb\u0151, A.: Personal communication (2026)"},{"key":"10_CR21","doi-asserted-by":"publisher","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 clutters. J. Lond. Math. Soc. 2, 356\u2013360 (1976)","journal-title":"J. Lond. Math. Soc."},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0012-365X(78)90116-4","volume":"23","author":"PD Seymour","year":"1978","unstructured":"Seymour, P.D.: A two-commodity cut theorem. Disc. Math. 23, 177\u2013181 (1978)","journal-title":"Disc. Math."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Ziegler, G.\u00a0M.: Lectures on polytopes. Grad. Texts in Math., 152. Springer, New York (1995)","DOI":"10.1007\/978-1-4613-8431-1"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28691-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:35:57Z","timestamp":1781303757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration of Competing Interests"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.math.unipd.it\/ipco2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}