{"id":"https://openalex.org/W2073756810","doi":"https://doi.org/10.1002/jgt.3190130110","title":"Infinite, highly connected digraphs with no two arc\u2010disjoint spanning trees","display_name":"Infinite, highly connected digraphs with no two arc\u2010disjoint spanning trees","publication_year":1989,"publication_date":"1989-03-01","ids":{"openalex":"https://openalex.org/W2073756810","doi":"https://doi.org/10.1002/jgt.3190130110","mag":"2073756810"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190130110","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5059026447","display_name":"Ron Aharoni","orcid":"https://orcid.org/0000-0002-1768-1901"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ron Aharoni","raw_affiliation_strings":["Mathematics Department, Technion, Haifa, Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"Mathematics Department, Technion, Haifa, Israel#TAB#","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062275812","display_name":"Carsten Thomassen","orcid":"https://orcid.org/0000-0003-0670-4079"},"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":"Carsten Thomassen","raw_affiliation_strings":["Mathematical Institute The Technical University Of Denmark Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Mathematical Institute The Technical University Of Denmark Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3760,"currency":"USD","value_usd":3760,"provenance":"doaj"},"apc_paid":null,"fwci":0.309,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":24,"citation_normalized_percentile":{"value":0.80667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":88},"biblio":{"volume":"13","issue":"1","first_page":"71","last_page":"74"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.998,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.998,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9978,"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9971,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/disjoint-sets","display_name":"Disjoint sets","score":0.6676771},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.45296976}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7805784},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.77899367},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6676771},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.62042016},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.5999002},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4707706},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.46849996},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.45296976},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.04683131}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190130110","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":9,"referenced_works":["https://openalex.org/W1516768651","https://openalex.org/W1531849983","https://openalex.org/W2019190176","https://openalex.org/W2048958570","https://openalex.org/W2059748966","https://openalex.org/W2120092792","https://openalex.org/W2313441277","https://openalex.org/W2798804414","https://openalex.org/W2911334367"],"related_works":["https://openalex.org/W2888241106","https://openalex.org/W2885112897","https://openalex.org/W2791036194","https://openalex.org/W2782194400","https://openalex.org/W26693340","https://openalex.org/W2354760237","https://openalex.org/W2343734929","https://openalex.org/W2182184069","https://openalex.org/W2088461731","https://openalex.org/W1971174658"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"present":[2],"a":[3],"construction":[4],"of":[5],"countably":[6],"infinite,":[7],"highly":[8],"connected":[9],"graphs":[10],"and":[11],"digraphs,":[12],"which":[13],"shows":[14],"that":[15],"several":[16],"basic":[17],"connectivity":[18],"results":[19],"on":[20],"finite":[21],"graphs,":[22],"including":[23],"Edmondsapos;s":[24],"branching":[25],"theorem,":[26],"cannot":[27],"be":[28],"extended":[29],"to":[30],"the":[31],"infinite":[32],"case.":[33]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2073756810","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":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-01-08T03:33:00.837370","created_date":"2016-06-24"}