{"id":"https://openalex.org/W2106970948","doi":"https://doi.org/10.1017/s0963548305007467","title":"An Upper Bound for Constrained Ramsey Numbers","display_name":"An Upper Bound for Constrained Ramsey Numbers","publication_year":2006,"publication_date":"2006-06-07","ids":{"openalex":"https://openalex.org/W2106970948","doi":"https://doi.org/10.1017/s0963548305007467","mag":"2106970948"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548305007467","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548305007467","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/A5101522065","display_name":"Peter J. Papadakos","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"]},{"id":"https://openalex.org/I4210153325","display_name":"Institute of Mathematical Statistics","ror":"https://ror.org/043f04882","country_code":"US","type":"other","lineage":["https://openalex.org/I4210153325"]}],"countries":["GB","US"],"is_corresponding":true,"raw_author_name":"PETER WAGNER","raw_affiliation_strings":["Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, University of Cambridge, Wilberforce Road, Cambridge, CB3 0WB, UK (e-mail:","Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, University of Cambridge, Wilberforce Road, Cambridge, CB3 0WB, UK (e-mail: pw236@cam.ac.uk)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, University of Cambridge, Wilberforce Road, Cambridge, CB3 0WB, UK (e-mail:","institution_ids":["https://openalex.org/I4210153325"]},{"raw_affiliation_string":"Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, University of Cambridge, Wilberforce Road, Cambridge, CB3 0WB, UK (e-mail: pw236@cam.ac.uk)#TAB#","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101522065"],"corresponding_institution_ids":["https://openalex.org/I241749","https://openalex.org/I4210153325"],"apc_list":null,"apc_paid":null,"fwci":1.8265,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.84117647,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"15","issue":"4","first_page":"619","last_page":"626"},"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.9998999834060669,"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.9998999834060669,"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.9986000061035156,"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.9977999925613403,"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.86451655626297},{"id":"https://openalex.org/keywords/ramseys-theorem","display_name":"Ramsey's theorem","score":0.7107357382774353},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6692218780517578},{"id":"https://openalex.org/keywords/monochromatic-color","display_name":"Monochromatic color","score":0.6564907431602478},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.577435314655304},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5582237243652344},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4997575283050537},{"id":"https://openalex.org/keywords/rainbow","display_name":"Rainbow","score":0.46307694911956787},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4522935152053833},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43777257204055786},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38459134101867676},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15941932797431946},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.11332213878631592},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.04347330331802368}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.86451655626297},{"id":"https://openalex.org/C44115641","wikidata":"https://www.wikidata.org/wiki/Q918099","display_name":"Ramsey's theorem","level":3,"score":0.7107357382774353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6692218780517578},{"id":"https://openalex.org/C40833965","wikidata":"https://www.wikidata.org/wiki/Q6901438","display_name":"Monochromatic color","level":2,"score":0.6564907431602478},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.577435314655304},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5582237243652344},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4997575283050537},{"id":"https://openalex.org/C2776558979","wikidata":"https://www.wikidata.org/wiki/Q1052","display_name":"Rainbow","level":2,"score":0.46307694911956787},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4522935152053833},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43777257204055786},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38459134101867676},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15941932797431946},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.11332213878631592},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.04347330331802368},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548305007467","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548305007467","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":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1999618770","https://openalex.org/W2056838769","https://openalex.org/W2066486518","https://openalex.org/W2137197373"],"related_works":["https://openalex.org/W2394414377","https://openalex.org/W2386551956","https://openalex.org/W2374811656","https://openalex.org/W2265564422","https://openalex.org/W4323065312","https://openalex.org/W2951614720","https://openalex.org/W4301078840","https://openalex.org/W4298879913","https://openalex.org/W1567601720","https://openalex.org/W2516261732"],"abstract_inverted_index":{"Let":[0,15],"$s$":[1,22],"and":[2,10,24],"$t$":[3,32,80],"be":[4,17,27],"integers":[5],"satisfying":[6],"$s":[7],"\\geq":[8,12],"2$":[9,13],"$t":[11],".":[14,33,67,81],"$S$":[16,60],"a":[18,56,62],"tree":[19],"of":[20,30,43,59,65,73],"size":[21],",":[23,52],"let":[25],"$P_t$":[26,66],"the":[28,44,71],"path":[29],"length":[31],"We":[34],"show":[35],"in":[36,69,79],"this":[37],"paper":[38],"that,":[39],"for":[40],"every":[41],"edge-colouring":[42],"complete":[45],"graph":[46],"on":[47],"$n$":[48],"vertices,":[49],"where":[50],"$n=224(s-1)^2t$":[51],"there":[53],"is":[54],"either":[55],"monochromatic":[57],"copy":[58,64],"or":[61],"rainbow":[63],"So,":[68],"particular,":[70],"number":[72],"vertices":[74],"needed":[75],"grows":[76],"only":[77],"linearly":[78]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}