{"id":"https://openalex.org/W1967257095","doi":"https://doi.org/10.1137/110850463","title":"On Maximal $S$-Free Sets and the Helly Number for the Family of $S$-Convex Sets","display_name":"On Maximal $S$-Free Sets and the Helly Number for the Family of $S$-Convex Sets","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1967257095","doi":"https://doi.org/10.1137/110850463","mag":"1967257095"},"language":"en","primary_location":{"id":"doi:10.1137/110850463","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110850463","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020875207","display_name":"Gennadiy Averkov","orcid":"https://orcid.org/0000-0003-2245-9958"},"institutions":[{"id":"https://openalex.org/I4210138551","display_name":"University Hospital Magdeburg","ror":"https://ror.org/03m04df46","country_code":"DE","type":"healthcare","lineage":["https://openalex.org/I4210138551"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Gennadiy Averkov","raw_affiliation_strings":["Institute for Mathematical Optimization, Faculty of Mathematics, University of Magdeburg, 39106 Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Institute for Mathematical Optimization, Faculty of Mathematics, University of Magdeburg, 39106 Magdeburg, Germany","institution_ids":["https://openalex.org/I4210138551"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020875207"],"corresponding_institution_ids":["https://openalex.org/I4210138551"],"apc_list":null,"apc_paid":null,"fwci":11.3793,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.98985884,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"27","issue":"3","first_page":"1610","last_page":"1624"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11830","display_name":"Point processes and geometric inequalities","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11830","display_name":"Point processes and geometric inequalities","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8590992093086243},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7748796343803406},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7177029848098755},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6146009564399719},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5842757821083069},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5809460878372192},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.5125834345817566},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5017187595367432},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.45261698961257935},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.341503381729126},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.21450188755989075},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1049896776676178},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06650331616401672}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8590992093086243},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7748796343803406},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7177029848098755},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6146009564399719},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5842757821083069},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5809460878372192},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.5125834345817566},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5017187595367432},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.45261698961257935},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.341503381729126},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.21450188755989075},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1049896776676178},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06650331616401672},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110850463","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110850463","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.6800000071525574,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W107540463","https://openalex.org/W1985421194","https://openalex.org/W1992399294","https://openalex.org/W2011116511","https://openalex.org/W2021567595","https://openalex.org/W2030141596","https://openalex.org/W2041512616","https://openalex.org/W2057392618","https://openalex.org/W2066037950","https://openalex.org/W2070134421","https://openalex.org/W2071996748","https://openalex.org/W2125198610","https://openalex.org/W2133520778","https://openalex.org/W2147468949","https://openalex.org/W2169739053","https://openalex.org/W2171213162","https://openalex.org/W2171238021","https://openalex.org/W2963846964"],"related_works":["https://openalex.org/W2916043681","https://openalex.org/W2896131632","https://openalex.org/W2391438543","https://openalex.org/W2008231869","https://openalex.org/W323119424","https://openalex.org/W2551069560","https://openalex.org/W1972258194","https://openalex.org/W2522231841","https://openalex.org/W2997473813","https://openalex.org/W2072510267"],"abstract_inverted_index":{"We":[0,88],"study":[1],"two":[2],"combinatorial":[3],"parameters,":[4],"which":[5,179],"we":[6,116],"denote":[7],"by":[8,109,191],"$f(S)$":[9,28,126],"and":[10,51,99,113,141,151,171,193],"$h(S)$,":[11],"associated":[12],"with":[13,49,55,82],"an":[14,96],"arbitrary":[15,97],"set":[16,187],"$S":[17,130],"\\subseteq":[18,143,189],"\\mathbb{R}^d$,":[19],"where":[20,137],"$d":[21],"\\in":[22],"\\mathbb{N}$.":[23],"In":[24],"the":[25,30,43,64,68,78,90,100,121,128,158,165,172],"nondegenerate":[26],"situation,":[27],"is":[29,47,53,63,120,145],"largest":[31],"possible":[32],"number":[33,66],"of":[34,36,45,67,70,80,86,154,163,169],"facets":[35],"a":[37,83],"$d$-dimensional":[38],"polyhedron":[39],"$L$":[40,46,52],"such":[41],"that":[42,73,118],"interior":[44],"disjoint":[48],"$S$":[50,81],"inclusion-maximal":[54],"respect":[56],"to":[57],"this":[58],"property.":[59],"The":[60,147],"parameter":[61],"$h(S)$":[62],"Helly":[65],"family":[69],"all":[71],"sets":[72],"can":[74],"be":[75],"given":[76],"as":[77],"intersection":[79],"convex":[84,186],"subset":[85],"$\\mathbb{R}^d$.":[87],"obtain":[89],"inequality":[91,173],"$f(S)":[92],"\\le":[93,177],"h(S)$":[94],"for":[95,103,184],"$S$,":[98],"equality":[101],"$f(S)=h(S)$":[102],"every":[104,185],"discrete":[105],"$S$.":[106],"Furthermore,":[107],"motivated":[108],"research":[110],"in":[111,127],"integer":[112],"mixed-integer":[114],"optimization,":[115],"show":[117],"$2^d$":[119],"sharp":[122],"upper":[123],"bound":[124],"on":[125],"case":[129],"=":[131,161],"(\\mathbb{Z}^d":[132],"\\times":[133],"\\mathbb{R}^n)":[134],"\\cap":[135,175],"C$,":[136],"$n":[138],"\\ge":[139],"0$":[140],"$C":[142,188],"\\mathbb{R}^{d+n}$":[144],"convex.":[146],"presented":[148],"material":[149],"generalizes":[150],"unifies":[152],"results":[153],"various":[155],"authors,":[156],"including":[157],"result":[159,167],"$h(\\mathbb{Z}^d)":[160],"2^d$":[162],"Doignon,":[164],"related":[166],"$f(\\mathbb{Z}^d)=2^d$":[168],"Lov\u00e1sz,":[170],"$f(\\mathbb{Z}^d":[174],"C)":[176],"2^d$,":[178],"has":[180],"recently":[181],"been":[182],"proved":[183],"\\mathbb{R}^d$":[190],"Mor\u00e1n":[192],"Dey.":[194]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":8}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}