{"id":"https://openalex.org/W2124889762","doi":"https://doi.org/10.37236/97","title":"The Block Connectivity of Random Trees","display_name":"The Block Connectivity of Random Trees","publication_year":2009,"publication_date":"2009-01-07","ids":{"openalex":"https://openalex.org/W2124889762","doi":"https://doi.org/10.37236/97","mag":"2124889762"},"language":"en","primary_location":{"id":"doi:10.37236/97","is_oa":true,"landing_page_url":"https://doi.org/10.37236/97","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r8/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":null,"license_id":null,"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/v16i1r8/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028143491","display_name":"Andrew R. A. McGrae","orcid":null},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Andrew R. A. McGrae","raw_affiliation_strings":["Department of Computer Science, University of Liverpool Ashton Street, Liverpool L69 3BX (UK)"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool Ashton Street, Liverpool L69 3BX (UK)","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013505086","display_name":"Michele Zito","orcid":null},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Michele Zito","raw_affiliation_strings":["Department of Computer Science, University of Liverpool Ashton Street, Liverpool L69 3BX (UK)"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool Ashton Street, Liverpool L69 3BX (UK)","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028143491"],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":null,"apc_paid":null,"fwci":0.4734,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61990325,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"16","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9993000030517578,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.9136311411857605},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.812907338142395},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7045149803161621},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5921240448951721},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5029546618461609},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46039220690727234}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9136311411857605},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.812907338142395},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7045149803161621},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5921240448951721},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5029546618461609},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46039220690727234}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/97","is_oa":true,"landing_page_url":"https://doi.org/10.37236/97","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r8/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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.719","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_16/PDF/v16i1r8.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/97","is_oa":true,"landing_page_url":"https://doi.org/10.37236/97","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r8/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":null,"license_id":null,"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/W2124889762.pdf","grobid_xml":"https://content.openalex.org/works/W2124889762.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W599250420","https://openalex.org/W1558737914","https://openalex.org/W2021304992","https://openalex.org/W3144881883"],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W4287664878","https://openalex.org/W3212023493","https://openalex.org/W1991411408","https://openalex.org/W2372403409","https://openalex.org/W2066456778"],"abstract_inverted_index":{"Let":[0],"$r$,":[1,66,93],"$m$,":[2],"and":[3,94],"$n$":[4,31,79,110],"be":[5,89],"positive":[6],"integers":[7],"such":[8],"that":[9,96],"$rm=n$.":[10],"For":[11],"each":[12,49],"$i":[13],"\\in":[14],"\\{1,":[15],"\\ldots,":[16,22],"m\\}$":[17],"let":[18],"$B_i":[19],"=":[20],"\\{r(i-1)+1,":[21],"ri\\}$.":[23],"The":[24],"$r$-block":[25,72],"connectivity":[26,37,73],"of":[27,38,65,74,84,106],"a":[28,52,75,103],"tree":[29,77],"on":[30,78,109],"labelled":[32],"vertices":[33,45],"is":[34,86,98],"the":[35,39,44,71,99],"vertex":[36],"graph":[40],"obtained":[41],"by":[42],"collapsing":[43],"in":[46],"$B_i$,":[47],"for":[48,62,81,102],"$i,$":[50],"to":[51,88],"single":[53],"(pseudo-)vertex":[54],"$v_i$.":[55],"In":[56],"this":[57],"paper":[58],"we":[59],"prove":[60],"that,":[61],"fixed":[63],"values":[64,83],"with":[67],"$r":[68],"\\geq":[69],"2$,":[70],"random":[76],"vertices,":[80],"large":[82],"$n$,":[85],"likely":[87],"either":[90],"$r-1$":[91,97],"or":[92],"furthermore":[95],"right":[100],"answer":[101],"constant":[104],"fraction":[105],"all":[107],"trees":[108],"vertices.":[111]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}