{"id":"https://openalex.org/W2964238781","doi":"https://doi.org/10.1017/s0963548313000503","title":"A Canonical Ramsey Theorem for Exactly <i>m</i>-Coloured Complete Subgraphs","display_name":"A Canonical Ramsey Theorem for Exactly <i>m</i>-Coloured Complete Subgraphs","publication_year":2013,"publication_date":"2013-10-18","ids":{"openalex":"https://openalex.org/W2964238781","doi":"https://doi.org/10.1017/s0963548313000503","mag":"2964238781"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548313000503","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548313000503","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046191276","display_name":"Teeradej Kittipassorn","orcid":"https://orcid.org/0000-0001-8039-393X"},"institutions":[{"id":"https://openalex.org/I94658018","display_name":"University of Memphis","ror":"https://ror.org/01cq23130","country_code":"US","type":"education","lineage":["https://openalex.org/I94658018"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"TEERADEJ KITTIPASSORN","raw_affiliation_strings":["Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, USA (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, USA (e-mail:","institution_ids":["https://openalex.org/I94658018"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045393655","display_name":"Bhargav Narayanan","orcid":null},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"BHARGAV P. NARAYANAN","raw_affiliation_strings":["Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Wilberforce Road, Cambridge CB3 0WB, UK (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Wilberforce Road, Cambridge CB3 0WB, UK (e-mail:","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7488,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.8936942,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"23","issue":"1","first_page":"102","last_page":"115"},"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T10588","display_name":"Mathematical Dynamics and Fractals","score":0.9627000093460083,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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.8190992474555969},{"id":"https://openalex.org/keywords/injective-function","display_name":"Injective function","score":0.7602771520614624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7269989252090454},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6398444175720215},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6165720224380493},{"id":"https://openalex.org/keywords/complete-graph","display_name":"Complete graph","score":0.4728204011917114},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43070802092552185}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8190992474555969},{"id":"https://openalex.org/C128107574","wikidata":"https://www.wikidata.org/wiki/Q182003","display_name":"Injective function","level":2,"score":0.7602771520614624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7269989252090454},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6398444175720215},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6165720224380493},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.4728204011917114},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43070802092552185}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548313000503","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548313000503","pdf_url":null,"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":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W185188870","https://openalex.org/W1520007244","https://openalex.org/W1999206300","https://openalex.org/W2005510206","https://openalex.org/W2021895021","https://openalex.org/W2046052042","https://openalex.org/W2062391526","https://openalex.org/W2066486518","https://openalex.org/W2095689360","https://openalex.org/W2160013978"],"related_works":["https://openalex.org/W2655188380","https://openalex.org/W1492157759","https://openalex.org/W2963000151","https://openalex.org/W2742781961","https://openalex.org/W2066767025","https://openalex.org/W2962729062","https://openalex.org/W2886974128","https://openalex.org/W2811294698","https://openalex.org/W2100011612","https://openalex.org/W2144885513"],"abstract_inverted_index":{"Given":[0],"an":[1,50,64],"edge":[2,31,103],"colouring":[3,79],"of":[4,10,24,33,73],"a":[5,8,87,112,128],"graph":[6,18,36],"with":[7,39,159],"set":[9],"m":[11,52,60,153],"colours":[12,26,42],",":[13],"we":[14,140],"say":[15],"that":[16,45,94,139],"the":[17,25,34,78,118],"is":[19,27,80,99],"exactly":[20,51,152],"m-coloured":[21],"if":[22],"each":[23,102],"used.":[28],"We":[29],"consider":[30],"colourings":[32,158],"complete":[35,54,155],"on":[37,82,121],"$\\mathbb{N}$":[38,69],"infinitely":[40],"many":[41,161],"and":[43,101,106,133],"show":[44],"either":[46,77],"one":[47,72],"can":[48],"find":[49],"-coloured":[53,154],"subgraph":[55],"for":[56],"every":[57],"natural":[58],"number":[59],"or":[61,84],"there":[62,85],"exists":[63,86],"infinite":[65],"subset":[66],"X":[67,83,92,95,107,122],"\u2282":[68],"coloured":[70],"in":[71,91,135,157],"two":[74],"canonical":[75],"ways:":[76],"injective":[81],"distinguished":[88],"vertex":[89],"v":[90,97,105,109,124],"such":[93],"\\{":[96,108,123],"}":[98,110],"1-coloured":[100],"between":[104],"has":[111],"distinct":[113],"colour":[114,119],"(all":[115],"different":[116],"to":[117,145],"used":[120],"}).":[125],"This":[126],"answers":[127],"question":[129],"posed":[130],"by":[131],"Stacey":[132],"Weidl":[134],"1999.":[136],"The":[137],"techniques":[138],"develop":[141],"also":[142],"enable":[143],"us":[144],"resolve":[146],"some":[147],"further":[148],"questions":[149],"about":[150],"finding":[151],"subgraphs":[156],"finitely":[160],"colours.":[162]},"counts_by_year":[{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}