{"id":"https://openalex.org/W7128646421","doi":"https://doi.org/10.1109/focs63196.2025.00104","title":"Polynomial bounds for the Graph Minor Structure Theorem","display_name":"Polynomial bounds for the Graph Minor Structure Theorem","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7128646421","doi":"https://doi.org/10.1109/focs63196.2025.00104"},"language":null,"primary_location":{"id":"doi:10.1109/focs63196.2025.00104","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00104","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-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/A5040993502","display_name":"Maximilian Gorsky","orcid":"https://orcid.org/0009-0001-7816-7084"},"institutions":[{"id":"https://openalex.org/I4210104335","display_name":"Institute for Basic Science","ror":"https://ror.org/00y0zf565","country_code":"KR","type":"facility","lineage":["https://openalex.org/I4210104335"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Maximilian Gorsky","raw_affiliation_strings":["Institute for Basic Science (IBS),Discrete Mathematics Group,Daejeon,South Korea"],"affiliations":[{"raw_affiliation_string":"Institute for Basic Science (IBS),Discrete Mathematics Group,Daejeon,South Korea","institution_ids":["https://openalex.org/I4210104335"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125627369","display_name":"Micha\u0142 T. Seweryn","orcid":null},"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":"Micha\u0142 T. Seweryn","raw_affiliation_strings":["Charles University,Computer Science Institute,Prague,Czech Republic"],"affiliations":[{"raw_affiliation_string":"Charles University,Computer Science Institute,Prague,Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065969392","display_name":"Sebastian Wiederrecht","orcid":"https://orcid.org/0000-0003-0462-7815"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sebastian Wiederrecht","raw_affiliation_strings":["KAIST,School of Computing,Daejeon,South Korea"],"affiliations":[{"raw_affiliation_string":"KAIST,School of Computing,Daejeon,South Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040993502"],"corresponding_institution_ids":["https://openalex.org/I4210104335"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.76497778,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1961","last_page":"1978"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.8108999729156494,"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.8108999729156494,"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.056699998676776886,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.041200000792741776,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/graph-minor","display_name":"Graph minor","score":0.6801000237464905},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4855000078678131},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4821999967098236},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.47110000252723694},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4602999985218048},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.4577000141143799},{"id":"https://openalex.org/keywords/complement-graph","display_name":"Complement graph","score":0.38359999656677246},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.3785000145435333},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3425999879837036}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7325999736785889},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.703000009059906},{"id":"https://openalex.org/C140752511","wikidata":"https://www.wikidata.org/wiki/Q905837","display_name":"Graph minor","level":5,"score":0.6801000237464905},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5443000197410583},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4855000078678131},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4821999967098236},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.47110000252723694},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4602999985218048},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.4577000141143799},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.38359999656677246},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.3785000145435333},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3425999879837036},{"id":"https://openalex.org/C100500283","wikidata":"https://www.wikidata.org/wiki/Q1374495","display_name":"Cubic graph","level":5,"score":0.33649998903274536},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.3352999985218048},{"id":"https://openalex.org/C161487630","wikidata":"https://www.wikidata.org/wiki/Q2800071","display_name":"Perfect graph theorem","level":5,"score":0.3248000144958496},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.31619998812675476},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.3073999881744385},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C173644813","wikidata":"https://www.wikidata.org/wiki/Q3527155","display_name":"Robertson\u2013Seymour theorem","level":5,"score":0.27959999442100525},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.27649998664855957},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.27000001072883606},{"id":"https://openalex.org/C180375552","wikidata":"https://www.wikidata.org/wiki/Q2635326","display_name":"Structured program theorem","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.2547000050544739}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs63196.2025.00104","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00104","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320326441","display_name":"Institute for Basic Science","ror":"https://ror.org/00y0zf565"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Graph":[1],"Minor":[2],"Structure":[3],"Theorem,":[4],"originally":[5],"proven":[6],"by":[7,88],"Robertson":[8,89],"and":[9,90,97,105,138,145,161,178],"Seymour":[10,91],"[JCTB,":[11],"2003],":[12],"asserts":[13],"that":[14,22,114,126,141,163,183],"there":[15],"exist":[16],"functions":[17,93],"${f_1},{f_2}:\\mathbb{N}":[18],"\\to":[19],"{\\mathbb{N}}$":[20],"such":[21],"for":[23,199],"every":[24,33],"non-planar":[25],"graph":[26,35,192],"H":[27,50,186],"with":[28,63],"t":[29],":=":[30],"|V":[31],"(H)|,":[32],"H-minor-free":[34],"can":[36,149],"be":[37,150,153],"obtained":[38],"via":[39],"the":[40,85,92,130],"clique-sum":[41,197],"operation":[42],"from":[43],"graphs":[44],"which":[45,75],"embed":[46,53],"into":[47],"surfaces":[48],"where":[49],"does":[51],"not":[52],"after":[54],"deleting":[55],"at":[56,66,79],"most":[57,67,80],"f<inf":[58,81,94,98,115,142,146,164],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[59,69,82,95,99,116,118,122,143,147,165,167,171],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</inf>(t)":[60],"many":[61,73],"vertices":[62],"up":[64],"to":[65,152],"t<sup":[68],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[70],"\u2212":[71],"1":[72],"\"vortices\"":[74],"are":[76,101,175],"of":[77],"\"depth\"":[78],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</inf>(t).":[83],"In":[84],"proof":[86,112],"presented":[87],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</inf>":[96,144],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</inf>":[100,148],"non-constructive.":[102],"Kawarabayashi,":[103,136],"Thomas,":[104,137],"Wollan":[106,139],"[arXiv,":[107],"2020]":[108],"found":[109],"a":[110,180,188,191,196],"new":[111],"showing":[113],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</inf>(t),f<inf":[117,166],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</inf>(t)":[119,168],"\u2208":[120,169],"2<sup":[121],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">poly(t)</sup>.":[123],"While":[124],"believing":[125],"this":[127,155],"bound":[128],"was":[129],"best":[131],"their":[132,159],"methods":[133],"could":[134],"achieve,":[135],"conjectured":[140],"improved":[151],"polynomials.In":[154],"paper":[156],"we":[157],"confirm":[158],"conjecture":[160],"prove":[162],"O(t<sup":[170],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2300</sup>).":[172],"Our":[173],"proofs":[174],"fully":[176],"constructive":[177],"yield":[179],"polynomial-time":[181],"algorithm":[182],"either":[184],"finds":[185],"as":[187,201],"minor":[189],"in":[190],"G":[193,200],"or":[194],"produces":[195],"decomposition":[198],"above.":[202]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2026-02-12T00:00:00"}