{"id":"https://openalex.org/W4402927348","doi":"https://doi.org/10.5070/c64264230","title":"Ubiquity of locally finite graphs with extensive tree-decompositions","display_name":"Ubiquity of locally finite graphs with extensive tree-decompositions","publication_year":2024,"publication_date":"2024-09-27","ids":{"openalex":"https://openalex.org/W4402927348","doi":"https://doi.org/10.5070/c64264230"},"language":"en","primary_location":{"id":"doi:10.5070/c64264230","is_oa":true,"landing_page_url":"http://dx.doi.org/10.5070/c64264230","pdf_url":null,"source":{"id":"https://openalex.org/S4210174179","display_name":"Combinatorial Theory","issn_l":"2766-1334","issn":["2766-1334"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorial Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://dx.doi.org/10.5070/c64264230","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112266022","display_name":"Nathan Bowler","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nathan Bowler","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038527552","display_name":"Christian Elbracht","orcid":"https://orcid.org/0000-0003-2481-364X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christian Elbracht","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028299034","display_name":"Joshua Erde","orcid":"https://orcid.org/0000-0003-1129-4270"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joshua Erde","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020317567","display_name":"J. Pascal Gollin","orcid":"https://orcid.org/0000-0003-2095-7101"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. Pascal Gollin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080349740","display_name":"Karl Heuer","orcid":"https://orcid.org/0000-0002-6841-9815"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Karl Heuer","raw_affiliation_strings":["Technical University of Denmark, Department of Applied Mathematics and Computer Science, DK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Department of Applied Mathematics and Computer Science, DK","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020032467","display_name":"Max Pitz","orcid":"https://orcid.org/0000-0001-8961-6132"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Max Pitz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5030838101","display_name":"Maximilian Teegen","orcid":"https://orcid.org/0000-0001-7384-742X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maximilian Teegen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5112266022"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6633,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73107009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"4","issue":"2","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.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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9904000163078308,"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.9803000092506409,"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/tree","display_name":"Tree (set theory)","score":0.5624088644981384},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4940946400165558},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45248913764953613},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4240318238735199},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34750795364379883},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34672707319259644}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5624088644981384},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4940946400165558},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45248913764953613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4240318238735199},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34750795364379883},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34672707319259644}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.5070/c64264230","is_oa":true,"landing_page_url":"http://dx.doi.org/10.5070/c64264230","pdf_url":null,"source":{"id":"https://openalex.org/S4210174179","display_name":"Combinatorial Theory","issn_l":"2766-1334","issn":["2766-1334"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorial Theory","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire/e16332e4-620e-4c71-9fbe-ce5315fda6c5","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/e16332e4-620e-4c71-9fbe-ce5315fda6c5","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bowler, N, Elbracht, C, Erde, J, Pascal Gollin, J, Heuer, K, Pitz, M & Teegen, M 2024, 'Ubiquity of locally finite graphs with extensive tree-decompositions', Combinatorial Theory, vol. 4, no. 2, 3. https://doi.org/10.5070/C64264230","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:escholarship.org:ark:/13030/qt7xg5m02t","is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/7xg5m02t","pdf_url":"https://escholarship.org/content/qt7xg5m02t/qt7xg5m02t.pdf","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Combinatorial Theory, vol 4, iss 2","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/e16332e4-620e-4c71-9fbe-ce5315fda6c5","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85205952946&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bowler, N, Elbracht, C, Erde, J, Pascal Gollin, J, Heuer, K, Pitz, M & Teegen, M 2024, 'Ubiquity of locally finite graphs with extensive tree-decompositions', Combinatorial Theory, vol. 4, no. 2, 3. https://doi.org/10.5070/C64264230","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/95025e34-ab92-4b94-8913-81026e715bed","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/95025e34-ab92-4b94-8913-81026e715bed","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bowler , N , Elbracht , C , Erde , J , Gollin , J P , Heuer , K , Pitz , M & Teegen , M 2024 , ' Ubiquity of locally finite graphs with extensive tree-decompositions ' , Combinatorial Theory , vol. 4 , no. 2 , 3 . https://doi.org/10.5070/C64264230","raw_type":"article"}],"best_oa_location":{"id":"doi:10.5070/c64264230","is_oa":true,"landing_page_url":"http://dx.doi.org/10.5070/c64264230","pdf_url":null,"source":{"id":"https://openalex.org/S4210174179","display_name":"Combinatorial Theory","issn_l":"2766-1334","issn":["2766-1334"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorial Theory","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3634255087","display_name":null,"funder_award_id":"648527","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G406461762","display_name":null,"funder_award_id":"IBS-R029-Y3","funder_id":"https://openalex.org/F4320326441","funder_display_name":"Institute for Basic Science"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320326441","display_name":"Institute for Basic Science","ror":"https://ror.org/00y0zf565"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2962838298","https://openalex.org/W2600246793"],"abstract_inverted_index":{"A":[0],"graph":[1,10,35,97],"\\(G\\)":[2],"is":[3,36],"said":[4],"to":[5],"be":[6],"ubiquitous,":[7],"if":[8],"every":[9,32,94],"\\(\\Gamma\\)":[11],"that":[12,31,43],"contains":[13,19],"arbitrarily":[14],"many":[15,21,80],"disjoint":[16,22],"\\(G\\)-minors":[17],"automatically":[18],"infinitely":[20],"\\(G\\)-minors.":[23],"The":[24],"well-known":[25],"Ubiquity":[26],"conjecture":[27],"of":[28,51,69,83],"Andreae":[29],"says":[30],"locally":[33,44,66,75,95],"finite":[34,45,67,70,76,86,96],"ubiquitous.":[37,60],"In":[38,61],"this":[39,63],"paper":[40],"we":[41,54],"show":[42],"graphs":[46,68,77],"admitting":[47],"a":[48],"certain":[49],"type":[50],"tree-decomposition,":[52,58],"which":[53,84],"call":[55],"an":[56,90,99],"extensive":[57,100],"are":[59],"particular":[62],"includes":[64],"all":[65,74,82],"tree-width,":[71],"and":[72],"also":[73],"with":[78],"finitely":[79],"ends,":[81],"have":[85],"degree.":[87],"It":[88],"remains":[89],"open":[91],"question":[92],"whether":[93],"admits":[98],"tree-decomposition.Mathematics":[101],"Subject":[102],"Classifications:":[103],"05C83,":[104],"05C63Keywords:":[105],"Graph":[106],"minors,":[107],"infinite":[108],"graphs,":[109],"ubiquity":[110]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-05-23T08:51:43.019350","created_date":"2025-10-10T00:00:00"}