{"id":"https://openalex.org/W7156944610","doi":"https://doi.org/10.48550/arxiv.2604.24216","title":"On Detecting $H$-Induced Minors for Small $H$","display_name":"On Detecting $H$-Induced Minors for Small $H$","publication_year":2026,"publication_date":"2026-04-27","ids":{"openalex":"https://openalex.org/W7156944610","doi":"https://doi.org/10.48550/arxiv.2604.24216"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.24216","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24216","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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.24216","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5094063465","display_name":"Tala Eagling-Vose","orcid":"https://orcid.org/0009-0008-0346-7032"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eagling-Vose, Tala","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013230954","display_name":"Barnaby Martin","orcid":"https://orcid.org/0000-0002-4642-8614"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin, Barnaby","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134795503","display_name":"Dani\u00ebl Paulusma","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Paulusma, Dani\u00ebl","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5056688500","display_name":"Nicolas Trotignon","orcid":"https://orcid.org/0000-0003-1978-0687"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Trotignon, Nicolas","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":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9315000176429749,"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.9315000176429749,"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.041200000792741776,"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.006599999964237213,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5982999801635742},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.45179998874664307},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43470001220703125},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3978999853134155},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.3264000117778778}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7505000233650208},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6261000037193298},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5982999801635742},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.45179998874664307},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43470001220703125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4230000078678131},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3978999853134155},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.3264000117778778},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.32510000467300415},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3127000033855438},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3125},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.2728999853134155}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.24216","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24216","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.24216","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24216","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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,78,110],"consider":[1],"the":[2,23,38,47,52,68,136],"$H$-Induced":[3,139],"Minor":[4,140],"problem:":[5],"for":[6,30,40,115,141],"a":[7,12,57,63,74,91,121,129],"fixed":[8],"graph~$H$,":[9],"decide":[10],"whether":[11],"given":[13],"graph":[14,122],"$G$":[15],"contains":[16],"$H$":[17,50,119,143],"as":[18],"an":[19,149],"induced":[20],"minor.":[21],"While":[22],"problem":[24,151],"is":[25,51,83,108,120,127],"known":[26],"to":[27,67],"be":[28],"NP-complete":[29],"some":[31,103],"trees~$H$":[32],"on":[33,59,123,144],"more":[34],"than":[35],"$2^{300}$":[36],"vertices,":[37],"complexity":[39],"small":[41],"trees":[42],"remains":[43],"unresolved.":[44],"In":[45,131],"particular,":[46],"case":[48,82],"where":[49,118],"$7$-vertex":[53],"tree":[54],"consisting":[55],"of":[56,93,104,138,152],"path":[58],"five":[60,124,145],"vertices":[61,125,146],"with":[62],"pendant":[64],"vertex":[65,72],"attached":[66],"second":[69],"and":[70,147,156],"fourth":[71],"was":[73],"long-standing":[75],"open":[76,150],"problem.":[77],"show":[79],"that":[80,89,101],"this":[81,132],"polynomial-time":[84,113],"solvable":[85],"by":[86],"developing":[87],"algorithms":[88,114],"detect":[90],"sequence":[92],"carefully":[94],"chosen":[95],"substructures.":[96],"Complementing":[97],"this,":[98],"we":[99,134],"prove":[100],"detecting":[102],"these":[105],"substructures":[106],"individually":[107],"NP-hard.":[109],"also":[111],"give":[112],"three":[116],"cases":[117],"(that":[126],"not":[128],"tree).":[130],"way,":[133],"completed":[135],"classification":[137],"graphs":[142],"answered":[148],"Dallard,":[153],"Dumas,":[154],"Hilaire":[155],"Perez":[157],"(2025).":[158]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-29T00:00:00"}