{"id":"https://openalex.org/W2071075508","doi":"https://doi.org/10.1017/s0963548313000151","title":"Size Ramsey Number of Bounded Degree Graphs for Games","display_name":"Size Ramsey Number of Bounded Degree Graphs for Games","publication_year":2013,"publication_date":"2013-06-11","ids":{"openalex":"https://openalex.org/W2071075508","doi":"https://doi.org/10.1017/s0963548313000151","mag":"2071075508"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548313000151","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548313000151","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B345B9006047AC6E738FD5CACEF64157/S0963548313000151a.pdf/div-class-title-size-ramsey-number-of-bounded-degree-graphs-for-games-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","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B345B9006047AC6E738FD5CACEF64157/S0963548313000151a.pdf/div-class-title-size-ramsey-number-of-bounded-degree-graphs-for-games-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044963823","display_name":"Heidi Gebauer","orcid":"https://orcid.org/0000-0002-7616-3821"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]},{"id":"https://openalex.org/I4210112966","display_name":"Instituto de F\u00edsica Te\u00f3rica","ror":"https://ror.org/022r8mj40","country_code":"ES","type":"facility","lineage":["https://openalex.org/I134820265","https://openalex.org/I4210112966","https://openalex.org/I63634437"]}],"countries":["CH","ES"],"is_corresponding":true,"raw_author_name":"HEIDI GEBAUER","raw_affiliation_strings":["Institute of Theoretical Computer Science, ETH Zurich, CH-8092Switzerland (e-mail:","Institute of Theoretical Computer Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Theoretical Computer Science, ETH Zurich, CH-8092Switzerland (e-mail:","institution_ids":["https://openalex.org/I35440088","https://openalex.org/I4210112966"]},{"raw_affiliation_string":"Institute of Theoretical Computer Science","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044963823"],"corresponding_institution_ids":["https://openalex.org/I35440088","https://openalex.org/I4210112966"],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":null,"fwci":0.5433,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63580786,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"22","issue":"4","first_page":"499","last_page":"516"},"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.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"}},"topics":[{"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9972000122070312,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9937000274658203,"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.856423020362854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6763531565666199},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5841835737228394},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5724891424179077},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5322800874710083},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5027780532836914},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49537932872772217},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.42498332262039185},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13332009315490723}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.856423020362854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6763531565666199},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5841835737228394},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5724891424179077},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5322800874710083},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5027780532836914},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49537932872772217},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.42498332262039185},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13332009315490723},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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":4,"locations":[{"id":"doi:10.1017/s0963548313000151","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548313000151","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B345B9006047AC6E738FD5CACEF64157/S0963548313000151a.pdf/div-class-title-size-ramsey-number-of-bounded-degree-graphs-for-games-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:research-collection.ethz.ch:20.500.11850/68238","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/68238","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability & Computing, 22 (4)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doc.rero.ch:300175","is_oa":false,"landing_page_url":"http://doc.rero.ch/record/300175/files/S0963548313000151.pdf","pdf_url":"http://doc.rero.ch/record/300175/files/S0963548313000151.pdf","source":{"id":"https://openalex.org/S4306400148","display_name":"reroDoc Digital Library","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"doi:10.3929/ethz-b-000068238","is_oa":true,"landing_page_url":"https://doi.org/10.3929/ethz-b-000068238","pdf_url":null,"source":{"id":"https://openalex.org/S7407051236","display_name":"ETH Z\u00fcrich Research Collection","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.1017/s0963548313000151","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548313000151","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B345B9006047AC6E738FD5CACEF64157/S0963548313000151a.pdf/div-class-title-size-ramsey-number-of-bounded-degree-graphs-for-games-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/W2071075508.pdf","grobid_xml":"https://content.openalex.org/works/W2071075508.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W619004858","https://openalex.org/W999599142","https://openalex.org/W1538750443","https://openalex.org/W1593970265","https://openalex.org/W1906724808","https://openalex.org/W1972779268","https://openalex.org/W1975791680","https://openalex.org/W1988370884","https://openalex.org/W1994115477","https://openalex.org/W1996196886","https://openalex.org/W1996656009","https://openalex.org/W1997949020","https://openalex.org/W2037348861","https://openalex.org/W2052690504","https://openalex.org/W2060159282","https://openalex.org/W2062589906","https://openalex.org/W2063722065","https://openalex.org/W2068485635","https://openalex.org/W2078983092","https://openalex.org/W2086253307","https://openalex.org/W2087086535","https://openalex.org/W2091128593","https://openalex.org/W2097354038","https://openalex.org/W2104812271","https://openalex.org/W2160743102","https://openalex.org/W2164302265","https://openalex.org/W4232923409","https://openalex.org/W4237717242","https://openalex.org/W4241497605","https://openalex.org/W4246925169","https://openalex.org/W6626141462"],"related_works":["https://openalex.org/W3161230432","https://openalex.org/W3013085049","https://openalex.org/W2168900540","https://openalex.org/W4367190712","https://openalex.org/W280458463","https://openalex.org/W1170131723","https://openalex.org/W4301429470","https://openalex.org/W2125310826","https://openalex.org/W2339723535","https://openalex.org/W1560496689"],"abstract_inverted_index":{"We":[0,39,192],"study":[1],"Maker/Breaker":[2],"games":[3],"on":[4],"the":[5,47,72,84,96,115,145,154,166,189],"edges":[6,17],"ofsparsegraphs.":[7],"Maker":[8,22,34,63,106,180],"and":[9],"Breaker":[10,30],"take":[11],"turns":[12],"at":[13,59],"claiming":[14],"previously":[15],"unclaimed":[16],"of":[18,53,83,160],"a":[19,26,45,57,65,69,77,80,89,102,108,112,151,173,182,186],"given":[20,27,90],"graphH.":[21],"aims":[23],"to":[24,32,67,110,143,184],"occupy":[25,68,111],"target":[28],"graphGand":[29],"tries":[31],"prevent":[33],"from":[35],"achieving":[36],"his":[37],"goal.":[38],"show":[40],"that":[41,49,62,105,124,170,194],"for":[42,50,125,150,153],"everydthere":[43],"is":[44,56,76,93],"constantc=c(d)with":[46],"property":[48],"every":[51,126],"graphGonnvertices":[52],"maximum":[54,130,161],"degreedthere":[55],"graphHon":[58],"mostcnedges":[60],"such":[61,104,169],"has":[64,107,181],"strategy":[66,109,183],"copy":[70,113,187],"ofGin":[71,114,188],"game":[73,116,190],"onH.":[74,117,191],"This":[75],"result":[78,122],"about":[79],"game-theoretic":[81],"variant":[82],"size":[85],"Ramsey":[86],"number.":[87],"For":[88],"graphG,":[91],"$\\hat{r}'(G)$":[92],"defined":[94],"as":[95],"smallest":[97],"numberMfor":[98],"which":[99],"there":[100,171],"exists":[101,172],"graphHwithMedges":[103,174],"In":[118],"this":[119],"language,":[120],"our":[121,141],"yields":[123],"connected":[127],"graphGof":[128],"constant":[129],"degree,":[131],"$\\hat{r}'(G)":[132],"=":[133,197],"\\Theta(n)$":[134],".":[135,201],"Moreover,":[136],"we":[137],"can":[138],"also":[139],"use":[140],"method":[142],"settle":[144],"corresponding":[146],"extremal":[147],"number":[148,168],"foruniversalgraphs:":[149],"constantdand":[152],"class":[155],"${\\cal":[156,177],"G}_{n}$":[157,178],"ofn-vertex":[158],"graphs":[159],"degreed,":[162],"$s({\\cal":[163,195],"G}_{n})$":[164],"denotes":[165],"minimum":[167],"where,":[175],"foreveryG\u2208":[176],",":[179],"build":[185],"obtain":[193],"G}_{n})":[196],"\\Theta(n^{2":[198],"-":[199],"\\frac{2}{d}})$":[200]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-27T14:10:00.468798","created_date":"2025-10-10T00:00:00"}