{"id":"https://openalex.org/W3197564529","doi":"https://doi.org/10.1017/s0963548324000385","title":"Ramsey simplicity of random graphs","display_name":"Ramsey simplicity of random graphs","publication_year":2024,"publication_date":"2024-12-03","ids":{"openalex":"https://openalex.org/W3197564529","doi":"https://doi.org/10.1017/s0963548324000385","mag":"3197564529"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548324000385","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548324000385","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BD0CD44AEAA11CC6317E38898387B170/S0963548324000385a.pdf/div-class-title-ramsey-simplicity-of-random-graphs-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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BD0CD44AEAA11CC6317E38898387B170/S0963548324000385a.pdf/div-class-title-ramsey-simplicity-of-random-graphs-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067579747","display_name":"Simona Boyadzhiyska","orcid":"https://orcid.org/0000-0002-0276-8588"},"institutions":[{"id":"https://openalex.org/I127817813","display_name":"Alfr\u00e9d R\u00e9nyi Institute of Mathematics","ror":"https://ror.org/03vw74f64","country_code":"HU","type":"facility","lineage":["https://openalex.org/I127817813","https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Simona Boyadzhiyska","raw_affiliation_strings":["Alfr\u00e9d R\u00e9nyi Institute of Mathematics, Budapest, Hungary"],"raw_orcid":"https://orcid.org/0000-0002-0276-8588","affiliations":[{"raw_affiliation_string":"Alfr\u00e9d R\u00e9nyi Institute of Mathematics, Budapest, Hungary","institution_ids":["https://openalex.org/I127817813"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035121909","display_name":"Dennis Clemens","orcid":"https://orcid.org/0000-0001-5940-6556"},"institutions":[{"id":"https://openalex.org/I159176309","display_name":"Universit\u00e4t Hamburg","ror":"https://ror.org/00g30e956","country_code":"DE","type":"education","lineage":["https://openalex.org/I159176309"]},{"id":"https://openalex.org/I884043246","display_name":"Hamburg University of Technology","ror":"https://ror.org/04bs1pb34","country_code":"DE","type":"education","lineage":["https://openalex.org/I884043246"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dennis Clemens","raw_affiliation_strings":["Institute of Mathematics, Hamburg University of Technology, Hamburg, Germany"],"raw_orcid":"https://orcid.org/0000-0001-5940-6556","affiliations":[{"raw_affiliation_string":"Institute of Mathematics, Hamburg University of Technology, Hamburg, Germany","institution_ids":["https://openalex.org/I159176309","https://openalex.org/I884043246"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066263695","display_name":"Shagnik Das","orcid":"https://orcid.org/0009-0004-4487-7741"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Shagnik Das","raw_affiliation_strings":["Department of Mathematics, National Taiwan University, Taipei, Taiwan"],"raw_orcid":"https://orcid.org/0009-0004-4487-7741","affiliations":[{"raw_affiliation_string":"Department of Mathematics, National Taiwan University, Taipei, Taiwan","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102765395","display_name":"Pranshu Gupta","orcid":"https://orcid.org/0000-0003-2257-4139"},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Pranshu Gupta","raw_affiliation_strings":["Faculty of Computer Science and Mathematics, University of Passau, Passau, Germany"],"raw_orcid":"https://orcid.org/0000-0003-2257-4139","affiliations":[{"raw_affiliation_string":"Faculty of Computer Science and Mathematics, University of Passau, Passau, Germany","institution_ids":["https://openalex.org/I186354981"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5066263695"],"corresponding_institution_ids":["https://openalex.org/I16733864"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00928678,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":"2","first_page":"298","last_page":"320"},"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.9997000098228455,"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.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9958000183105469,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/combinatorics","display_name":"Combinatorics","score":0.9019284248352051},{"id":"https://openalex.org/keywords/ramseys-theorem","display_name":"Ramsey's theorem","score":0.896441638469696},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6505088806152344},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5378661751747131},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.503971517086029},{"id":"https://openalex.org/keywords/simple-graph","display_name":"Simple graph","score":0.4709521234035492},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4668278098106384},{"id":"https://openalex.org/keywords/ramsey-theory","display_name":"Ramsey theory","score":0.4569838345050812},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4458233416080475}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9019284248352051},{"id":"https://openalex.org/C44115641","wikidata":"https://www.wikidata.org/wiki/Q918099","display_name":"Ramsey's theorem","level":3,"score":0.896441638469696},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6505088806152344},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5378661751747131},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.503971517086029},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.4709521234035492},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4668278098106384},{"id":"https://openalex.org/C112291201","wikidata":"https://www.wikidata.org/wiki/Q1336170","display_name":"Ramsey theory","level":2,"score":0.4569838345050812},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4458233416080475},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548324000385","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548324000385","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BD0CD44AEAA11CC6317E38898387B170/S0963548324000385a.pdf/div-class-title-ramsey-simplicity-of-random-graphs-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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2109.04140","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2109.04140","pdf_url":"https://arxiv.org/pdf/2109.04140","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/7173b63f-8787-44e9-ad20-b0fc6cdc9e89","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/7173b63f-8787-44e9-ad20-b0fc6cdc9e89","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Boyadzhiyska , S , Clemens , D , Das , S &amp; Gupta , P 2021 ' Ramsey simplicity of random graphs ' .","raw_type":"workingPaper"}],"best_oa_location":{"id":"doi:10.1017/s0963548324000385","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548324000385","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BD0CD44AEAA11CC6317E38898387B170/S0963548324000385a.pdf/div-class-title-ramsey-simplicity-of-random-graphs-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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3197564529.pdf"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W390146837","https://openalex.org/W1487872891","https://openalex.org/W1643959696","https://openalex.org/W1864971073","https://openalex.org/W1992843513","https://openalex.org/W2001172982","https://openalex.org/W2006825591","https://openalex.org/W2028276181","https://openalex.org/W2030696417","https://openalex.org/W2034622005","https://openalex.org/W2036786740","https://openalex.org/W2037351637","https://openalex.org/W2038937017","https://openalex.org/W2045472305","https://openalex.org/W2058619174","https://openalex.org/W2063722065","https://openalex.org/W2094054391","https://openalex.org/W2095689360","https://openalex.org/W2188797527","https://openalex.org/W2336317531","https://openalex.org/W2610302269","https://openalex.org/W2768930897","https://openalex.org/W2795915197","https://openalex.org/W2905110430","https://openalex.org/W2950761217","https://openalex.org/W3005256584","https://openalex.org/W3026254307","https://openalex.org/W3047480355","https://openalex.org/W3081713386","https://openalex.org/W3083934630","https://openalex.org/W3100937370","https://openalex.org/W3123434898","https://openalex.org/W4241684091","https://openalex.org/W4248191427","https://openalex.org/W4253985608"],"related_works":["https://openalex.org/W2474561564","https://openalex.org/W2949231378","https://openalex.org/W4297961547","https://openalex.org/W2950410478","https://openalex.org/W4301914467","https://openalex.org/W4297817664","https://openalex.org/W2292548913","https://openalex.org/W1901246819","https://openalex.org/W4301765976","https://openalex.org/W2945124636"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"graph":[2,10,102,129],"$G$":[3,18,77],"is":[4,20,70,78,104,119,131,182,189,228,260,285],"$q$":[5,15,80,105,170,192,230,286],"-":[6,92,106],"Ramsey":[7,30,63,107],"for":[8,33,82,154,195,233,245],"another":[9],"$H$":[11,25,83,103,284],"if":[12,76,109,289,292],"in":[13,39,46,190],"any":[14,196,234],"-edge-colouring":[16],"of":[17,24,37,50,58,62,121,272,278],"there":[19,259],"a":[21,41,101],"monochromatic":[22],"copy":[23],",":[26,96,200,223,255,267],"and":[27,53,97,160,290],"the":[28,34,47,56,66,127,270,273,279],"classic":[29],"problem":[31],"asks":[32],"minimum":[35,67],"number":[36],"vertices":[38],"such":[40,282],"graph.":[42],"This":[43],"was":[44],"broadened":[45],"seminal":[48],"work":[49],"Burr,":[51],"Erd\u0151s,":[52],"Lov\u00e1sz":[54],"to":[55,73,168],"investigation":[57],"other":[59],"extremal":[60],"parameters":[61],"graphs,":[64,124],"including":[65],"degree.":[68],"It":[69],"not":[71,183,229],"hard":[72],"see":[74],"that":[75,100,117,126,180,226,258,283],"minimally":[79],"-Ramsey":[81,135,171,186,193,231,287],"we":[84,98,148,164,224,240,256],"must":[85],"have":[86],"$\\delta":[87],"(G)":[88],"\\ge":[89,236],"q(\\delta":[90],"(H)":[91],"1)":[93],"+":[94],"1$":[95],"say":[99],"simple":[108,136,194,232,288],"this":[110,118,146,150],"bound":[111],"can":[112,165],"be":[113,169],"attained.":[114],"Grinshpun":[115],"showed":[116],"typical":[120],"rather":[122],"sparse":[123],"proving":[125],"random":[128,280],"$G(n,p)$":[130,167,181,227],"almost":[132],"surely":[133],"$2$":[134,185],"when":[137,214],"$\\frac{\\log":[138,206],"n}{n}":[139,207,220],"\\ll":[140,142,203,208,210,251,253],"p":[141,209,252],"n^{-2/3}$":[143,211],".":[144,212,238],"In":[145],"paper,":[147],"explore":[149],"question":[151],"further,":[152],"asking":[153],"which":[155],"pairs":[156],"$p":[157,202,215],"=":[158,162,198,265],"p(n)$":[159],"$q":[161,197,235],"q(n,p)$":[163],"expect":[166],"simple.":[172],"We":[173],"first":[174],"extend":[175],"Grinshpun\u2019s":[176],"result":[177],"by":[178],"showing":[179],"just":[184],"simple,":[187],"but":[188],"fact":[191],"q(n)$":[199],"provided":[201],"n^{-1}$":[204],"or":[205],"Next,":[213],"\\gg":[216],"\\left":[217],"(":[218],"\\frac{\\log":[219],"\\right":[221],")^{1/2}$":[222],"find":[225,257],"2$":[237],"Finally,":[239],"uncover":[241],"some":[242,261],"interesting":[243],"behaviour":[244],"intermediate":[246],"edge":[247],"probabilities.":[248],"When":[249],"$n^{-2/3}":[250],"n^{-1/2}$":[254],"finite":[262],"threshold":[263],"$\\tilde{q}":[264],"\\tilde{q}(H)$":[266],"depending":[268],"on":[269],"structure":[271],"instance":[274],"$H":[275],"\\sim":[276],"G(n,p)$":[277],"graph,":[281],"only":[291],"<jats:inline-graphic":[293]},"counts_by_year":[],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}
