{"id":"https://openalex.org/W1525199496","doi":"https://doi.org/10.37236/2832","title":"Matroid and Tutte-Connectivity in Infinite Graphs","display_name":"Matroid and Tutte-Connectivity in Infinite Graphs","publication_year":2014,"publication_date":"2014-05-02","ids":{"openalex":"https://openalex.org/W1525199496","doi":"https://doi.org/10.37236/2832","mag":"1525199496"},"language":"en","primary_location":{"id":"doi:10.37236/2832","is_oa":true,"landing_page_url":"https://doi.org/10.37236/2832","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v21i2p14/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v21i2p14/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081417865","display_name":"Henning Bruhn","orcid":"https://orcid.org/0000-0003-0484-6815"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Henning Bruhn","raw_affiliation_strings":["Universit\u00e4t Ulm","Universit\u00e4t ULM"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Ulm","institution_ids":["https://openalex.org/I196349391"]},{"raw_affiliation_string":"Universit\u00e4t ULM","institution_ids":["https://openalex.org/I196349391"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5081417865"],"corresponding_institution_ids":["https://openalex.org/I196349391"],"apc_list":null,"apc_paid":null,"fwci":0.3561,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.58666252,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"21","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.9988999962806702,"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.9988999962806702,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9843000173568726,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/matroid","display_name":"Matroid","score":0.9283812046051025},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8367819786071777},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7629983425140381},{"id":"https://openalex.org/keywords/dual-graph","display_name":"Dual graph","score":0.7533371448516846},{"id":"https://openalex.org/keywords/tutte-polynomial","display_name":"Tutte polynomial","score":0.6765214204788208},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5377398133277893},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.42199909687042236},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37660524249076843},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1219353973865509},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.05109518766403198}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9283812046051025},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8367819786071777},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7629983425140381},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.7533371448516846},{"id":"https://openalex.org/C14447369","wikidata":"https://www.wikidata.org/wiki/Q7857002","display_name":"Tutte polynomial","level":5,"score":0.6765214204788208},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5377398133277893},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.42199909687042236},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37660524249076843},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1219353973865509},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.05109518766403198}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/2832","is_oa":true,"landing_page_url":"https://doi.org/10.37236/2832","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v21i2p14/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/2832","is_oa":true,"landing_page_url":"https://doi.org/10.37236/2832","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v21i2p14/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1525199496.pdf","grobid_xml":"https://content.openalex.org/works/W1525199496.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1529872609","https://openalex.org/W1758887450","https://openalex.org/W1966836246","https://openalex.org/W2100108609","https://openalex.org/W2146437659","https://openalex.org/W2156361463","https://openalex.org/W2156958352","https://openalex.org/W2335172256","https://openalex.org/W2594578442","https://openalex.org/W2950280062","https://openalex.org/W4297571003","https://openalex.org/W4300950946"],"related_works":["https://openalex.org/W2550106438","https://openalex.org/W3193643106","https://openalex.org/W3165795633","https://openalex.org/W146649319","https://openalex.org/W2106412416","https://openalex.org/W802746881","https://openalex.org/W2325477667","https://openalex.org/W2008472326","https://openalex.org/W2494200571","https://openalex.org/W2046712280"],"abstract_inverted_index":{"We":[0],"relate":[1],"matroid":[2,20],"connectivity":[3,37],"to":[4],"Tutte-connectivity":[5,49],"in":[6,25],"an":[7,40],"infinite":[8,28,47],"graph.":[9],"Moreover,":[10],"we":[11,42],"show":[12],"that":[13],"the":[14,18,22,35],"two":[15],"cycle":[16,23],"matroids,":[17],"finite-cycle":[19],"and":[21],"matroid,":[24],"which":[26],"also":[27,45],"cycles":[29],"are":[30],"taken":[31],"into":[32],"account,":[33],"have":[34],"same":[36],"function.":[38],"As":[39],"application":[41],"re-prove":[43],"that,":[44],"for":[46],"graphs,":[48],"is":[50],"invariant":[51],"under":[52],"taking":[53],"dual":[54],"graphs.":[55]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}