{"id":"https://openalex.org/W4415244164","doi":"https://doi.org/10.1017/s0963548325100187","title":"A note on the computational complexity of weak saturation","display_name":"A note on the computational complexity of weak saturation","publication_year":2025,"publication_date":"2025-10-16","ids":{"openalex":"https://openalex.org/W4415244164","doi":"https://doi.org/10.1017/s0963548325100187"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548325100187","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548325100187","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/F5D93134697F6E76099CCBA449E807D4/S0963548325100187a.pdf/div-class-title-a-note-on-the-computational-complexity-of-weak-saturation-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/F5D93134697F6E76099CCBA449E807D4/S0963548325100187a.pdf/div-class-title-a-note-on-the-computational-complexity-of-weak-saturation-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089164987","display_name":"Martin Tancer","orcid":"https://orcid.org/0000-0002-1191-6714"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Martin Tancer","raw_affiliation_strings":["Charles University"],"affiliations":[{"raw_affiliation_string":"Charles University","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009339365","display_name":"Mykhaylo Tyomkyn","orcid":"https://orcid.org/0000-0002-3491-4068"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Mykhaylo Tyomkyn","raw_affiliation_strings":["Charles University"],"affiliations":[{"raw_affiliation_string":"Charles University","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009339365"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.35760005,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"35","issue":"1","first_page":"83","last_page":"88"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9797999858856201,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11210","display_name":"Mathematical Analysis and Transform Methods","score":0.9796000123023987,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/saturation","display_name":"Saturation (graph theory)","score":0.6244000196456909},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.583299994468689},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43389999866485596},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.3443000018596649},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.31220000982284546}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6858000159263611},{"id":"https://openalex.org/C9930424","wikidata":"https://www.wikidata.org/wiki/Q7426587","display_name":"Saturation (graph theory)","level":2,"score":0.6244000196456909},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.583299994468689},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43389999866485596},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39309999346733093},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37400001287460327},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.3443000018596649},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.31220000982284546},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3010999858379364},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3005000054836273},{"id":"https://openalex.org/C121864883","wikidata":"https://www.wikidata.org/wiki/Q677916","display_name":"Statistical physics","level":1,"score":0.29750001430511475},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.28529998660087585},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548325100187","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548325100187","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/F5D93134697F6E76099CCBA449E807D4/S0963548325100187a.pdf/div-class-title-a-note-on-the-computational-complexity-of-weak-saturation-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s0963548325100187","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548325100187","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/F5D93134697F6E76099CCBA449E807D4/S0963548325100187a.pdf/div-class-title-a-note-on-the-computational-complexity-of-weak-saturation-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415244164.pdf","grobid_xml":"https://content.openalex.org/works/W4415244164.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1516308076","https://openalex.org/W1977436094","https://openalex.org/W1992614687","https://openalex.org/W1998853144","https://openalex.org/W2013335595","https://openalex.org/W2025223814","https://openalex.org/W2034962669","https://openalex.org/W2048774399","https://openalex.org/W2062088180","https://openalex.org/W2063472176","https://openalex.org/W2070418505","https://openalex.org/W2073328888","https://openalex.org/W2091757636","https://openalex.org/W2148333157","https://openalex.org/W2949936695","https://openalex.org/W2967936998","https://openalex.org/W3197336419","https://openalex.org/W3210517074","https://openalex.org/W4386478101","https://openalex.org/W4409350628","https://openalex.org/W4414357675"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1],"prove":[2],"that":[3],"determining":[4],"the":[5,28,40],"weak":[6,37],"saturation":[7,38],"number":[8],"of":[9,42],"a":[10,17,34],"host":[11],"graph":[12,19],"$F$":[13],"with":[14],"respect":[15],"to":[16],"pattern":[18],"$H$":[20,26],"is":[21,27],"computationally":[22],"hard,":[23],"even":[24],"when":[25],"triangle.":[29],"Our":[30],"main":[31],"tool":[32],"establishes":[33],"connection":[35],"between":[36],"and":[39],"shellability":[41],"simplicial":[43],"complexes.":[44]},"counts_by_year":[],"updated_date":"2026-03-12T06:13:28.667946","created_date":"2025-10-16T00:00:00"}