{"id":"https://openalex.org/W2024979825","doi":"https://doi.org/10.1137/120888703","title":"A Lower Bound for the Complexity of Monotone Graph Properties","display_name":"A Lower Bound for the Complexity of Monotone Graph Properties","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2024979825","doi":"https://doi.org/10.1137/120888703","mag":"2024979825"},"language":"en","primary_location":{"id":"doi:10.1137/120888703","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120888703","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/A5058341188","display_name":"Robert Scheidweiler","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Scheidweiler","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5109963706","display_name":"Eberhard Triesch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eberhard Triesch","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0936,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.78334694,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"27","issue":"1","first_page":"257","last_page":"265"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9940000176429749,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.8408088684082031},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7772724628448486},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7659128904342651},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6119502782821655},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5465294718742371},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5133189558982849},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.4820724129676819},{"id":"https://openalex.org/keywords/prime-power","display_name":"Prime power","score":0.4414818286895752},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4227408468723297}],"concepts":[{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.8408088684082031},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7772724628448486},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7659128904342651},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6119502782821655},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5465294718742371},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5133189558982849},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.4820724129676819},{"id":"https://openalex.org/C174072685","wikidata":"https://www.wikidata.org/wiki/Q1667469","display_name":"Prime power","level":3,"score":0.4414818286895752},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4227408468723297},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/120888703","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120888703","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"},{"id":"pmh:oai:publications.rwth-aachen.de:216780","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/216780","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM journal on discrete mathematics 27(1), 257-265 (2013). doi:10.1137/120888703","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7599999904632568,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1535866048","https://openalex.org/W1966167835","https://openalex.org/W1980974491","https://openalex.org/W1983880126","https://openalex.org/W1995945562","https://openalex.org/W2001332511","https://openalex.org/W2016606569","https://openalex.org/W2023396579","https://openalex.org/W2047659391","https://openalex.org/W2071863116","https://openalex.org/W2076597612","https://openalex.org/W2079486985","https://openalex.org/W2080620555","https://openalex.org/W2147862220","https://openalex.org/W2320553184","https://openalex.org/W2479604145","https://openalex.org/W2798943694","https://openalex.org/W2963198457","https://openalex.org/W3107709063","https://openalex.org/W3175367423"],"related_works":["https://openalex.org/W2150672947","https://openalex.org/W2081116272","https://openalex.org/W2767659640","https://openalex.org/W2374829073","https://openalex.org/W2385671392","https://openalex.org/W2016890960","https://openalex.org/W2610737932","https://openalex.org/W3100417154","https://openalex.org/W2299120352","https://openalex.org/W2741785956"],"abstract_inverted_index":{"More":[0],"than":[1],"30":[2],"years":[3],"ago,":[4],"Karp":[5],"conjectured":[6],"that":[7],"all":[8],"nontrivial":[9],"monotone":[10],"graph":[11],"properties":[12],"are":[13],"evasive,":[14],"i.e.,":[15],"have":[16],"decision":[17],"tree":[18],"complexity":[19],"$\\binom{n}{2}$,":[20],"where":[21],"$n$":[22,44],"is":[23,45],"the":[24],"number":[25],"of":[26,61],"vertices.":[27],"It":[28],"was":[29],"proved":[30],"in":[31],"1984":[32],"by":[33,49],"Kahn,":[34],"Saks,":[35],"and":[36],"Sturtevant":[37],"[Combinatorica,":[38],"4":[39],"(1984),":[40],"pp.":[41],"297--306]":[42],"if":[43],"a":[46,50,58],"prime":[47],"power":[48],"topological":[51],"approach.":[52],"Using":[53],"their":[54],"method,":[55],"we":[56],"prove":[57],"lower":[59],"bound":[60],"$\\frac{1}{3}n^2-o(n^2)$":[62],"for":[63],"general":[64],"$n$.":[65]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}