{"id":"https://openalex.org/W2001332511","doi":"https://doi.org/10.1137/s0097539700382005","title":"Evasiveness of Subgraph Containment and Related Properties","display_name":"Evasiveness of Subgraph Containment and Related Properties","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2001332511","doi":"https://doi.org/10.1137/s0097539700382005","mag":"2001332511"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539700382005","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539700382005","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5084208266","display_name":"Amit Chakrabarti","orcid":"https://orcid.org/0000-0003-3633-9180"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amit Chakrabarti","raw_affiliation_strings":["Department of Computer Science, Princeton, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Subhash Khot","raw_affiliation_strings":["Department of Computer Science, Princeton, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102846971","display_name":"Yaoyun Shi","orcid":"https://orcid.org/0000-0001-5523-6166"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yaoyun Shi","raw_affiliation_strings":["Department of Computer Science, Princeton, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":1.8235,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.83139178,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"31","issue":"3","first_page":"866","last_page":"875"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9965999722480774,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9965999722480774,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9965000152587891,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9919000267982483,"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/planarity-testing","display_name":"Planarity testing","score":0.8091599345207214},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7572504281997681},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7048593163490295},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7041147947311401},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6876592636108398},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5803812742233276},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.5381982922554016},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.48875927925109863},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4582367241382599},{"id":"https://openalex.org/keywords/containment","display_name":"Containment (computer programming)","score":0.44074544310569763},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4382270574569702},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4044548571109772},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13563421368598938},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.12883126735687256},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12070101499557495}],"concepts":[{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.8091599345207214},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7572504281997681},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7048593163490295},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7041147947311401},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6876592636108398},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5803812742233276},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.5381982922554016},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.48875927925109863},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4582367241382599},{"id":"https://openalex.org/C2777019822","wikidata":"https://www.wikidata.org/wiki/Q390066","display_name":"Containment (computer programming)","level":2,"score":0.44074544310569763},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4382270574569702},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4044548571109772},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13563421368598938},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.12883126735687256},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12070101499557495},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539700382005","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539700382005","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7799999713897705,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1510730180","https://openalex.org/W1966167835","https://openalex.org/W2016606569","https://openalex.org/W2023396579","https://openalex.org/W2065844587","https://openalex.org/W2071863116","https://openalex.org/W2079486985","https://openalex.org/W2147862220"],"related_works":["https://openalex.org/W2489339695","https://openalex.org/W2949735222","https://openalex.org/W4300919538","https://openalex.org/W4299570239","https://openalex.org/W1979242696","https://openalex.org/W2167462019","https://openalex.org/W1581957840","https://openalex.org/W2951550838","https://openalex.org/W2950813087","https://openalex.org/W4320022211"],"abstract_inverted_index":{"We":[0,73,126],"prove":[1,74,127],"new":[2],"results":[3],"on":[4,65],"evasiveness":[5,48],"of":[6,14,27,41,53,55,70,107],"monotone":[7],"graph":[8,44,82],"properties":[9,76],"by":[10],"extending":[11],"the":[12,25,66,108],"techniques":[13],"Kahn,":[15],"Saks,":[16],"and":[17,36,102],"Sturtevant":[18],"[Combinatorica,":[19],"4":[20],"(1984),":[21],"pp.":[22],"297--306].":[23],"For":[24],"property":[26],"containing":[28],"a":[29,33,37,59,94,128],"subgraph":[30,133],"isomorphic":[31],"to":[32,97],"fixed":[34],"graph,":[35],"fairly":[38],"large":[39,89],"class":[40],"related":[42],"n-vertex":[43],"properties,":[45],"we":[46],"show":[47],"for":[49,86,131],"an":[50],"arithmetic":[51],"progression":[52],"values":[54],"n.":[56,90],"This":[57,91],"implies":[58],"$\\frac12n^2":[60],"-":[61],"O(n)$":[62],"lower":[63],"bound":[64],"decision":[67],"tree":[68],"complexity":[69],"these":[71],"properties.":[72],"that":[75,77,122],"are":[78,84],"preserved":[79],"under":[80],"taking":[81],"minors":[83],"evasive":[85],"all":[87],"sufficiently":[88],"greatly":[92],"generalizes":[93],"theorem":[95],"due":[96],"Best,":[98],"van":[99],"Emde":[100],"Boas,":[101],"Lenstra":[103],"[A":[104],"Sharpened":[105],"Version":[106],"Aanderaa--Rosenberg":[109],"Conjecture,":[110],"Report":[111],"ZW":[112],"30/74,":[113],"Mathematisch":[114],"Centrum,":[115],"Amsterdam,":[116],"The":[117],"Netherlands,":[118],"1974]":[119],"which":[120],"states":[121],"planarity":[123],"is":[124],"evasive.":[125],"similar":[129],"result":[130],"bipartite":[132],"containment.":[134]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}