{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:42:52Z","timestamp":1787323372461,"version":"build-2736575974"},"reference-count":21,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>For an integer $n\\geq 3$, the clutter $\\Delta_n:=\\big\\{\\{1,2\\},\\{1,3\\},\\ldots,\\{1,n\\},\\{2,3,\\ldots,n\\}\\big\\}$ is called a delta of dimension $n$, whose members are the lines of a degenerate projective plane. In his seminal paper on nonideal clutters, Lehman revealed the role of the deltas as a distinct class of minimally nonideal clutters [ The width length inequality and degenerate projective planes, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 1, AMS, Providence, RI, 1990, pp. 101--105]. A clutter is delta free if it has no delta minor. Binary clutters, ideal clutters, and clutters with the packing property are examples of delta free clutters. In this paper, we introduce and study basic geometric notions defined on clutters, including entanglement between clutters, a notion that is intimately linked with set covering polyhedra having a convex union. We will then investigate the surprising geometric attributes of delta minors and delta free clutters.<\/jats:p>","DOI":"10.1137\/17m1126758","type":"journal-article","created":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T12:30:08Z","timestamp":1532435408000},"page":"1750-1774","source":"Crossref","is-referenced-by-count":2,"title":["Delta Minors, Delta Free Clutters, and Entanglement"],"prefix":"10.1137","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3008-4167","authenticated-orcid":true,"given":"Ahmad","family":"Abdi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kanstantsin","family":"Pashkovich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,7,24]]},"reference":[{"key":"atypb1","unstructured":"A. Abdi,\n                      Ideal Clutters\n                      , Ph.D. Dissertation, University of Waterloo, Waterloo, Ontario, Canada, 2018."},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0871"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0864"},{"key":"atypb5","unstructured":"A. Bemporad, K., Fukuda, and F. D. Torrisi,\n                      Convexity Recognition of the Union of Polyhedra\n                      , Technical Report AUT00-13, Automatic Control Laboratory, ETH Zurich, Switzerland, 2000."},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(01)00004-9"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1137\/0608052"},{"key":"atypb8","doi-asserted-by":"crossref","unstructured":"M. Conforti and G. Cornue\u0301jols,\n                      Clutters That Pack and the Max-Flow Min-Cut Property: A Conjecture\n                      , The Fourth Bellairs Workshop on Combinatorial Optimization, 1993.","DOI":"10.21236\/ADA277340"},{"key":"atypb9","doi-asserted-by":"crossref","unstructured":"M. Conforti, G. Cornue\u0301jols, and G. Zambelli,\n                      Integer Programming\n                      , Grad. Texts in Math. 271, Springer, Cham, 2014.","DOI":"10.1007\/978-3-319-11008-0"},{"key":"atypb10","doi-asserted-by":"crossref","unstructured":"G. Cornue\u0301jols,\n                      Combinatorial Optimization, Packing and Covering\n                      , SIAM, Philadelphia, 2001.","DOI":"10.1137\/1.9780898717105"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011389"},{"key":"atypb12","doi-asserted-by":"crossref","unstructured":"G. Cornue\u0301jols and B. Novick,\n                      Ideal 0,1 matrices\n                      , J. Combin. Theory Ser. B, 60 (1994), pp. 145-157.","DOI":"10.1006\/jctb.1994.1009"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0103-y"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(70)80083-7"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591851"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-015-0251-3"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-58-02537-7"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1137\/0112059"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588263"},{"key":"atypb20","first-page":"101","author":"Lehman A.","year":"1990","journal-title":"RI"},{"key":"atypb21","doi-asserted-by":"crossref","unstructured":"P. D. Seymour,\n                      On Lehman's width-length characterization\n                      , DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 1, AMS, Providence, RI, 1990, pp. 107-117.","DOI":"10.1090\/dimacs\/001\/11"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-12.3.356"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/17M1126758","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:58:41Z","timestamp":1787320721000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/17M1126758"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/17M1126758"],"URL":"https:\/\/doi.org\/10.1137\/17m1126758","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}