{"id":"https://openalex.org/W2052068320","doi":"https://doi.org/10.1017/s0963548311000186","title":"Random Graphs with Few Disjoint Cycles","display_name":"Random Graphs with Few Disjoint Cycles","publication_year":2011,"publication_date":"2011-06-09","ids":{"openalex":"https://openalex.org/W2052068320","doi":"https://doi.org/10.1017/s0963548311000186","mag":"2052068320"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548311000186","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548311000186","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/33DE14F786FB2B78D8EDD220CF095DF9/S0963548311000186a.pdf/div-class-title-random-graphs-with-few-disjoint-cycles-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/33DE14F786FB2B78D8EDD220CF095DF9/S0963548311000186a.pdf/div-class-title-random-graphs-with-few-disjoint-cycles-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021094928","display_name":"Valentas Kurauskas","orcid":null},"institutions":[{"id":"https://openalex.org/I173212132","display_name":"Vilnius University","ror":"https://ror.org/03nadee84","country_code":"LT","type":"education","lineage":["https://openalex.org/I173212132"]}],"countries":["LT"],"is_corresponding":true,"raw_author_name":"VALENTAS KURAUSKAS","raw_affiliation_strings":["Vilnius University, Naugarduko 24, LT-03225 Vilnius, Lithuania (e-mail:","Vilnius university, naugarduko 24, lt-03225 vilnius, lithuania (e-mail: valentas@gmail.com)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Vilnius University, Naugarduko 24, LT-03225 Vilnius, Lithuania (e-mail:","institution_ids":["https://openalex.org/I173212132"]},{"raw_affiliation_string":"Vilnius university, naugarduko 24, lt-03225 vilnius, lithuania (e-mail: valentas@gmail.com)#TAB#","institution_ids":["https://openalex.org/I173212132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111437501","display_name":"Colin McDiarmid","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"COLIN McDIARMID","raw_affiliation_strings":["Department of Statistics, University of Oxford, 1 South Parks Road, Oxford OX1 3TG, UK (e-mail:","Department of Statistics, University of Oxford, 1 South Parks Road, Oxford OX1 3TG, UK (e-mail: cmcd@stats.ox.ac.uk)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Statistics, University of Oxford, 1 South Parks Road, Oxford OX1 3TG, UK (e-mail:","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Department of Statistics, University of Oxford, 1 South Parks Road, Oxford OX1 3TG, UK (e-mail: cmcd@stats.ox.ac.uk)#TAB#","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021094928"],"corresponding_institution_ids":["https://openalex.org/I173212132"],"apc_list":null,"apc_paid":null,"fwci":1.6304,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.83377888,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"20","issue":"5","first_page":"763","last_page":"775"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9998000264167786,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9970999956130981,"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.8068294525146484},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7514805793762207},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5524255633354187},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5443349480628967},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5425700545310974},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4572976529598236},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4208124876022339}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8068294525146484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7514805793762207},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5524255633354187},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5443349480628967},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5425700545310974},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4572976529598236},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4208124876022339}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548311000186","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548311000186","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/33DE14F786FB2B78D8EDD220CF095DF9/S0963548311000186a.pdf/div-class-title-random-graphs-with-few-disjoint-cycles-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"}],"best_oa_location":{"id":"doi:10.1017/s0963548311000186","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548311000186","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/33DE14F786FB2B78D8EDD220CF095DF9/S0963548311000186a.pdf/div-class-title-random-graphs-with-few-disjoint-cycles-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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2052068320.pdf","grobid_xml":"https://content.openalex.org/works/W2052068320.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W186403072","https://openalex.org/W1258338664","https://openalex.org/W1569752386","https://openalex.org/W2021469741","https://openalex.org/W2057826895","https://openalex.org/W2073593086","https://openalex.org/W2079566953","https://openalex.org/W2113232101","https://openalex.org/W2134147092","https://openalex.org/W2316246740","https://openalex.org/W2328959383","https://openalex.org/W2329551700","https://openalex.org/W2332112754","https://openalex.org/W2340541605","https://openalex.org/W2477427859","https://openalex.org/W2798588639","https://openalex.org/W6702351051"],"related_works":["https://openalex.org/W2940821404","https://openalex.org/W3185918591","https://openalex.org/W4206244388","https://openalex.org/W3109685666","https://openalex.org/W2998932593","https://openalex.org/W3033876040","https://openalex.org/W2770134917","https://openalex.org/W4296581269","https://openalex.org/W1984834024","https://openalex.org/W4320340728"],"abstract_inverted_index":{"The":[0],"classical":[1],"Erd\u0151s\u2013P\u00f3sa":[2,141],"theorem":[3,128,142],"states":[4],"that":[5,45,59,132,148],"for":[6,156],"each":[7,21],"positive":[8],"integer":[9],"k":[10,16,28,43,55,92,161],"there":[11,33,133],"is":[12,34,129,152],"an":[13,83],"f":[14,41,53],"(":[15,42,54],")":[17,56],"such":[18,58,71],"that,":[19,68],"in":[20,122,139],"graph":[22,102],"G":[23,60],"which":[24],"does":[25],"not":[26],"have":[27,87],"+":[29],"1":[30],"disjoint":[31],"cycles,":[32],"a":[35,47,88,100,136,154],"blocker":[36,89,137,155],"of":[37,50,90,99,110,125],"size":[38,91],"at":[39,51,159],"most":[40,52,160],");":[44],"is,":[46],"set":[48,75],"B":[49,62,149,165],"vertices":[57,162],"\u2212":[61],"has":[63],"no":[64],"cycles.":[65],"We":[66,94],"show":[67,131],"amongst":[69],"all":[70,81,157],"graphs":[72],"on":[73],"vertex":[74],"{1,.":[76],".":[77,93,166],".,":[78],"n":[79],"},":[80],"but":[82,158],"exponentially":[84],"small":[85],"proportion":[86],"also":[95],"give":[96],"further":[97],"properties":[98],"random":[101],"sampled":[103],"uniformly":[104],"from":[105],"this":[106],"class,":[107],"concerning":[108],"uniqueness":[109],"the":[111,123,126,140,144],"blocker,":[112],"connectivity,":[113],"chromatic":[114],"number":[115],"and":[116],"clique":[117],"number.":[118],"A":[119],"key":[120],"step":[121],"proof":[124],"main":[127],"to":[130],"must":[134],"be":[135],"as":[138],"with":[143],"extra":[145],"\u2018redundancy\u2019":[146],"property":[147],"\u2013":[150],"v":[151,163],"still":[153],"\u2208":[164]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}