{"id":"https://openalex.org/W2124391922","doi":"https://doi.org/10.37236/650","title":"On the Path-Avoidance Vertex-Coloring Game","display_name":"On the Path-Avoidance Vertex-Coloring Game","publication_year":2011,"publication_date":"2011-08-12","ids":{"openalex":"https://openalex.org/W2124391922","doi":"https://doi.org/10.37236/650","mag":"2124391922"},"language":"en","primary_location":{"id":"doi:10.37236/650","is_oa":true,"landing_page_url":"https://doi.org/10.37236/650","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p163/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p163/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028248747","display_name":"Torsten M\u00fctze","orcid":"https://orcid.org/0000-0002-6383-7436"},"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"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Torsten M\u00fctze","raw_affiliation_strings":["[ETH, Zurich]"],"affiliations":[{"raw_affiliation_string":"[ETH, Zurich]","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041974050","display_name":"Reto Sp\u00f6hel","orcid":null},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Reto Sp\u00f6hel","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028248747"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":2.6884,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.89245636,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"18","issue":"1","first_page":null,"last_page":null},"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.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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.8666356205940247},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8110357522964478},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.7193443775177002},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5903159379959106},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5606687068939209},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49677640199661255},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44332998991012573},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42461469769477844},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41660934686660767}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8666356205940247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8110357522964478},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.7193443775177002},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5903159379959106},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5606687068939209},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49677640199661255},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44332998991012573},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42461469769477844},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41660934686660767},{"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/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"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.37236/650","is_oa":true,"landing_page_url":"https://doi.org/10.37236/650","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p163/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/650","is_oa":true,"landing_page_url":"https://doi.org/10.37236/650","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p163/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2124391922.pdf","grobid_xml":"https://content.openalex.org/works/W2124391922.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1494890830","https://openalex.org/W1524397983","https://openalex.org/W1966321066","https://openalex.org/W1974559507","https://openalex.org/W1985022633","https://openalex.org/W2042818642","https://openalex.org/W2067023564","https://openalex.org/W2083596217","https://openalex.org/W2124391922","https://openalex.org/W2131312475","https://openalex.org/W2132122319","https://openalex.org/W4241215401","https://openalex.org/W6629724202","https://openalex.org/W6631309204","https://openalex.org/W6666937826","https://openalex.org/W6679256826"],"related_works":["https://openalex.org/W2916710807","https://openalex.org/W4286907761","https://openalex.org/W2413588304","https://openalex.org/W3205447645","https://openalex.org/W2009411567","https://openalex.org/W3087772622","https://openalex.org/W2013252038","https://openalex.org/W2386598361","https://openalex.org/W2078375028","https://openalex.org/W2029016716"],"abstract_inverted_index":{"For":[0,66],"any":[1,5],"graph":[2,64],"$F$":[3,14],"and":[4,15,81,94,136,150,167],"integer":[6,134],"$r\\geq":[7],"2$,":[8],"the":[9,46,51,61,108,116,138],"online":[10,47],"vertex-Ramsey":[11,48],"density":[12,49],"of":[13,53,70,83,145],"$r$,":[16],"denoted":[17],"$m^*(F,r)$,":[18],"is":[19,90,112,118,122,174],"a":[20,24,37,54,67,86,113,142,162],"parameter":[21,33],"defined":[22,133],"via":[23],"deterministic":[25],"two-player":[26],"Ramsey-type":[27],"game":[28,58],"(Painter":[29,59],"vs.":[30,60],"Builder).":[31],"This":[32],"was":[34,43],"introduced":[35],"in":[36,165],"recent":[38],"paper":[39],"[arXiv:1103.5849],":[40],"where":[41,110],"it":[42],"shown":[44],"that":[45,106,127,137,154,170],"determines":[50],"threshold":[52],"similar":[55],"probabilistic":[56],"one-player":[57],"binomial":[62],"random":[63],"$G_{n,p}$).":[65],"large":[68],"class":[69],"graphs":[71],"$F$,":[72],"including":[73],"cliques,":[74],"cycles,":[75],"complete":[76],"bipartite":[77],"graphs,":[78],"hypercubes,":[79],"wheels,":[80],"stars":[82],"arbitrary":[84],"size,":[85],"simple":[87],"greedy":[88,139,158],"strategy":[89,140],"optimal":[91],"for":[92,97,107,130],"Painter":[93,152],"closed":[95],"formulas":[96],"$m^*(F,r)$":[98],"are":[99],"known.":[100],"In":[101],"this":[102,157],"work":[103],"we":[104,168],"show":[105,169],"case":[109],"$F=P_\\ell$":[111],"long":[114],"path,":[115],"picture":[117],"very":[119],"different.":[120],"It":[121],"not":[123],"hard":[124],"to":[125],"see":[126],"$m^*(P_\\ell,r)=":[128],"1-1/k^*(P_\\ell,r)$":[129],"an":[131],"appropriately":[132],"$k^*(P_\\ell,r)$,":[135],"gives":[141],"lower":[143,159],"bound":[144,160],"$k^*(P_\\ell,r)\\geq":[146],"\\ell^r$.":[147],"We":[148],"construct":[149],"analyze":[151],"strategies":[153],"improve":[155],"on":[156],"by":[161],"factor":[163],"polynomial":[164],"$\\ell$,":[166],"no":[171],"superpolynomial":[172],"improvement":[173],"possible.":[175]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}