{"id":"https://openalex.org/W2605816692","doi":"https://doi.org/10.23638/lmcs-15(1:25)2019","title":"On the First-Order Complexity of Induced Subgraph Isomorphism","display_name":"On the First-Order Complexity of Induced Subgraph Isomorphism","publication_year":2019,"publication_date":"2019-03-06","ids":{"openalex":"https://openalex.org/W2605816692","doi":"https://doi.org/10.23638/lmcs-15(1:25)2019","mag":"2605816692"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-15(1:25)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(1:25)2019","pdf_url":"https://lmcs.episciences.org/5261/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/5261/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064842516","display_name":"Oleg Verbitsky","orcid":"https://orcid.org/0000-0002-9524-1901"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Oleg Verbitsky","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5054841023","display_name":"Maksim Zhukovskii","orcid":"https://orcid.org/0000-0001-8763-9533"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]},{"id":"https://openalex.org/I4210089467","display_name":"Institute of Physics and Technology","ror":"https://ror.org/005n3yy14","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210089467"]}],"countries":["DE","RU"],"is_corresponding":false,"raw_author_name":"Maksim Zhukovskii","raw_affiliation_strings":["Institut fr Informatik , Humboldt-Universitt zu Berlin , Unter den Linden 6 , D-10099 Berlin. Laboratory of Advanced Combinatorics and Network Applications ,","Moscow Institute of Physics and Technology , Moscow"],"affiliations":[{"raw_affiliation_string":"Institut fr Informatik , Humboldt-Universitt zu Berlin , Unter den Linden 6 , D-10099 Berlin. Laboratory of Advanced Combinatorics and Network Applications ,","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Moscow Institute of Physics and Technology , Moscow","institution_ids":["https://openalex.org/I4210089467"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064842516"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61298778,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"Volume 15, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.998199999332428,"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/T11567","display_name":"semigroups and automata theory","score":0.9969000220298767,"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/combinatorics","display_name":"Combinatorics","score":0.8556708097457886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.696811854839325},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.656030535697937},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5571418404579163},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.531089186668396},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4882376492023468},{"id":"https://openalex.org/keywords/graph-homomorphism","display_name":"Graph homomorphism","score":0.43777161836624146},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4133363366127014},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.18450704216957092},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.17011597752571106},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.11896765232086182},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.0674717128276825}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8556708097457886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.696811854839325},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.656030535697937},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5571418404579163},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.531089186668396},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4882376492023468},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.43777161836624146},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4133363366127014},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18450704216957092},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.17011597752571106},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.11896765232086182},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0674717128276825},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.23638/lmcs-15(1:25)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(1:25)2019","pdf_url":"https://lmcs.episciences.org/5261/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1704.02237","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1704.02237","pdf_url":"https://arxiv.org/pdf/1704.02237","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1704.02237","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1704.02237","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.4230/lipics.csl.2017.40","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.csl.2017.40","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"doi:10.23638/lmcs-15(1:25)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(1:25)2019","pdf_url":"https://lmcs.episciences.org/5261/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1629925082","display_name":null,"funder_award_id":"15-01-03530","funder_id":"https://openalex.org/F4320321079","funder_display_name":"Russian Foundation for Basic Research"},{"id":"https://openalex.org/G413006471","display_name":null,"funder_award_id":"15-01-03530 and 16-31-60052","funder_id":"https://openalex.org/F4320321079","funder_display_name":"Russian Foundation for Basic Research"},{"id":"https://openalex.org/G7268992540","display_name":null,"funder_award_id":"16-31-60052","funder_id":"https://openalex.org/F4320321079","funder_display_name":"Russian Foundation for Basic Research"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321079","display_name":"Russian Foundation for Basic Research","ror":"https://ror.org/02mh1ke95"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2605816692.pdf","grobid_xml":"https://content.openalex.org/works/W2605816692.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W51516856","https://openalex.org/W94262720","https://openalex.org/W104109059","https://openalex.org/W1529283357","https://openalex.org/W1564608677","https://openalex.org/W1883038075","https://openalex.org/W1966115134","https://openalex.org/W1973113631","https://openalex.org/W1988762827","https://openalex.org/W1991858502","https://openalex.org/W2015906942","https://openalex.org/W2028357390","https://openalex.org/W2028775537","https://openalex.org/W2050273816","https://openalex.org/W2092294035","https://openalex.org/W2114047496","https://openalex.org/W2119414881","https://openalex.org/W2120248756","https://openalex.org/W2130190334","https://openalex.org/W2132921321","https://openalex.org/W2150875823","https://openalex.org/W2174237477","https://openalex.org/W2618244641","https://openalex.org/W2786963442","https://openalex.org/W2944700340","https://openalex.org/W3028653830"],"related_works":["https://openalex.org/W3191028777","https://openalex.org/W2789636091","https://openalex.org/W2252464404","https://openalex.org/W4254708154","https://openalex.org/W2282273380","https://openalex.org/W4292749945","https://openalex.org/W3008959778","https://openalex.org/W2032950096","https://openalex.org/W2766767719","https://openalex.org/W2957388536"],"abstract_inverted_index":{"Given":[0],"a":[1,80,98,136,143,166,218,240],"graph":[2,45,99,129,137,205],"$F$,":[3],"let":[4],"$I(F)$":[5,25,180],"be":[6,193],"the":[7,20,43,63,90,106,113,127,149,152,175,184,203,210,235],"class":[8],"of":[9,35,65,70,83,97,108,228],"graphs":[10],"containing":[11],"$F$":[12,100,122,134],"as":[13,38,157,174],"an":[14,95],"induced":[15],"subgraph.":[16],"Let":[17],"$W[F]$":[18,102],"denote":[19],"minimum":[21,176],"$k$":[22,177],"such":[23,178],"that":[24,75,118,179,190],"is":[26,47,77,135,172,181],"definable":[27,78,182],"in":[28,49,59,110,151,183],"$k$-variable":[29],"first-order":[30,81,236],"logic.":[31],"The":[32],"recognition":[33],"problem":[34],"$I(F)$,":[36],"known":[37],"Induced":[39],"Subgraph":[40],"Isomorphism":[41],"(for":[42],"pattern":[44],"$F$),":[46],"solvable":[48],"time":[50],"$O(n^{W[F]})$.":[51],"Motivated":[52],"by":[53,79],"this":[54],"fact,":[55],"we":[56,73,116,141,215],"are":[57],"interested":[58],"determining":[60],"or":[61],"estimating":[62],"value":[64],"$W[F]$.":[66,197],"Using":[67,209],"Olariu's":[68],"characterization":[69],"paw-free":[71],"graphs,":[72],"show":[74,189],"$I(K_3+e)$":[76],"sentence":[82],"quantifier":[84,232,237],"depth":[85,238],"3,":[86],"where":[87,148],"$K_3+e$":[88],"denotes":[89],"paw":[91,128],"graph.":[92],"This":[93,160],"provides":[94],"example":[96],"with":[101],"strictly":[103,194],"less":[104,195],"than":[105,196],"number":[107],"vertices":[109,125],"$F$.":[111],"On":[112],"other":[114],"hand,":[115],"prove":[117,142],"$W[F]=4$":[119],"for":[120,165,200,213,221],"all":[121],"on":[123,138,206],"4":[124,207],"except":[126],"and":[130],"its":[131],"complement.":[132],"If":[133],"$t$":[139,158],"vertices,":[140],"general":[144],"lower":[145,211],"bound":[146,161,212],"$W[F]>(1/2-o(1))t$,":[147],"function":[150],"little-o":[153],"notation":[154],"approaches":[155],"0":[156],"inreases.":[159],"holds":[162],"true":[163],"even":[164],"related":[167],"parameter":[168],"$W^*[F]\\le":[169],"W[F]$,":[170],"which":[171],"defined":[173],"infinitary":[185],"logic":[186],"$L^k_{\\infty\\omega}$.":[187],"We":[188],"$W^*[F]$":[191],"can":[192],"Specifically,":[198],"$W^*[P_4]=3$":[199],"$P_4$":[201],"being":[202],"path":[204],"vertices.":[208],"$W[F]$,":[214],"also":[216],"obtain":[217],"succintness":[219],"result":[220],"existential":[222],"monadic":[223,231],"second-order":[224],"logic:":[225],"A":[226],"usage":[227],"just":[229],"one":[230],"sometimes":[233],"reduces":[234],"at":[239],"super-recursive":[241],"rate.":[242]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}