{"id":"https://openalex.org/W2061450212","doi":"https://doi.org/10.1017/s0963548312000272","title":"Connectivity for Bridge-Addable Monotone Graph Classes","display_name":"Connectivity for Bridge-Addable Monotone Graph Classes","publication_year":2012,"publication_date":"2012-07-30","ids":{"openalex":"https://openalex.org/W2061450212","doi":"https://doi.org/10.1017/s0963548312000272","mag":"2061450212"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548312000272","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548312000272","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/438FF524012960BD21DD79CE888F85C6/S0963548312000272a.pdf/div-class-title-connectivity-for-bridge-addable-monotone-graph-classes-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/438FF524012960BD21DD79CE888F85C6/S0963548312000272a.pdf/div-class-title-connectivity-for-bridge-addable-monotone-graph-classes-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085128089","display_name":"Louigi Addario\u2010Berry","orcid":"https://orcid.org/0000-0001-7125-5746"},"institutions":[{"id":"https://openalex.org/I4210146410","display_name":"Science Oxford","ror":"https://ror.org/04j8yhy50","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I4210146410"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"L. ADDARIO-BERRY","raw_affiliation_strings":["Department of statistics, 1 south parks road, oxford, ox1 3tg, uk (e-mail: louigi@gmail.com, cmcd@stats.ox.ac.uk)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of statistics, 1 south parks road, oxford, ox1 3tg, uk (e-mail: louigi@gmail.com, cmcd@stats.ox.ac.uk)#TAB#","institution_ids":["https://openalex.org/I4210146410"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111437501","display_name":"Colin McDiarmid","orcid":null},"institutions":[{"id":"https://openalex.org/I4210146410","display_name":"Science Oxford","ror":"https://ror.org/04j8yhy50","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I4210146410"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"C. MCDIARMID","raw_affiliation_strings":["Department of statistics, 1 south parks road, oxford, ox1 3tg, uk (e-mail: louigi@gmail.com, cmcd@stats.ox.ac.uk)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of statistics, 1 south parks road, oxford, ox1 3tg, uk (e-mail: louigi@gmail.com, cmcd@stats.ox.ac.uk)#TAB#","institution_ids":["https://openalex.org/I4210146410"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108103165","display_name":"Bruce Reed","orcid":"https://orcid.org/0009-0002-5656-8941"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"B. REED","raw_affiliation_strings":["School of computer science, mcgill university, 3480 university street, montreal, quebec, h3a 2a7, canada (e-mail: breed@cs.mcgill.ca)#TAB#"],"affiliations":[{"raw_affiliation_string":"School of computer science, mcgill university, 3480 university street, montreal, quebec, h3a 2a7, canada (e-mail: breed@cs.mcgill.ca)#TAB#","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5085128089"],"corresponding_institution_ids":["https://openalex.org/I4210146410"],"apc_list":null,"apc_paid":null,"fwci":3.1151,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.91796284,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"21","issue":"6","first_page":"803","last_page":"815"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.9991000294685364,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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.7785177826881409},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7381165623664856},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.7062658071517944},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6996859908103943},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6690266132354736},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5988403558731079},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.5322859883308411},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4495660960674286},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.04285675287246704}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7785177826881409},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7381165623664856},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.7062658071517944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6996859908103943},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6690266132354736},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5988403558731079},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.5322859883308411},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4495660960674286},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.04285675287246704},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0963548312000272","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548312000272","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/438FF524012960BD21DD79CE888F85C6/S0963548312000272a.pdf/div-class-title-connectivity-for-bridge-addable-monotone-graph-classes-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.748.8220","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.748.8220","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1110.0009.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1017/s0963548312000272","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548312000272","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/438FF524012960BD21DD79CE888F85C6/S0963548312000272a.pdf/div-class-title-connectivity-for-bridge-addable-monotone-graph-classes-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2061450212.pdf","grobid_xml":"https://content.openalex.org/works/W2061450212.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W151079317","https://openalex.org/W390146837","https://openalex.org/W599250420","https://openalex.org/W643126808","https://openalex.org/W1258338664","https://openalex.org/W1479863711","https://openalex.org/W1589957632","https://openalex.org/W1978453013","https://openalex.org/W1998162291","https://openalex.org/W1999694424","https://openalex.org/W2000910910","https://openalex.org/W2018165282","https://openalex.org/W2049665706","https://openalex.org/W2058824702","https://openalex.org/W2099300815","https://openalex.org/W2108315536","https://openalex.org/W2117621804","https://openalex.org/W2134147092","https://openalex.org/W2252330517","https://openalex.org/W2616697817","https://openalex.org/W2905110430","https://openalex.org/W3141776272","https://openalex.org/W6738002306"],"related_works":["https://openalex.org/W1489292980","https://openalex.org/W2795079910","https://openalex.org/W2951610245","https://openalex.org/W1430963189","https://openalex.org/W3037410748","https://openalex.org/W4319835971","https://openalex.org/W2052430123","https://openalex.org/W2049901819","https://openalex.org/W1983437306","https://openalex.org/W1974262772"],"abstract_inverted_index":{"A":[0],"class":[1,42,69],"of":[2,23,54,117,120,128],"labelled":[3],"graphs":[4,10],"is":[5,37,43,90,92,130],"bridge-addable":[6],"if,":[7,45],"for":[8,46,65],"all":[9,14,47,51],"G":[11,24,48,55],"in":[12,19,39],"and":[13,17,35,50,123,141],"vertices":[15],"u":[16,34],"v":[18,36],"distinct":[20],"connected":[21,91],"components":[22],",":[25,56,101],"the":[26,41,80,114,118,126],"graph":[27,84],"obtained":[28,137],"by":[29,139],"adding":[30],"an":[31],"edge":[32],"between":[33],"also":[38,135],";":[40],"monotone":[44,68],"\u2208":[49,60],"subgraphs":[52],"H":[53,59],"we":[57],"have":[58,72],".":[61,76],"We":[62],"show":[63],"that":[64,82],"any":[66],"bridge-addable,":[67],"whose":[70],"elements":[71],"vertex":[73],"set":[74],"{1,.":[75],".,":[77],"n":[78,97,104,109],"},":[79],"probability":[81],"a":[83],"chosen":[85],"uniformly":[86],"at":[87,93],"random":[88],"from":[89],"least":[94],"(1\u2212":[95],"o":[96,103],"(1))":[98],"e":[99],"\u2212\u00bd":[100],"where":[102],"(1)":[105],"\u2192":[106,110],"0":[107],"as":[108],"\u221e.":[111],"This":[112,132],"establishes":[113],"special":[115],"case":[116],"conjecture":[119],"McDiarmid,":[121],"Steger":[122],"Welsh":[124],"when":[125],"condition":[127],"monotonicity":[129],"added.":[131],"result":[133],"has":[134],"been":[136],"independently":[138],"Kang":[140],"Panagiotou.":[142]},"counts_by_year":[{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}