{"id":"https://openalex.org/W2126482858","doi":"https://doi.org/10.37236/551","title":"Lower Bounds on van der Waerden Numbers: Randomized- and Deterministic-Constructive","display_name":"Lower Bounds on van der Waerden Numbers: Randomized- and Deterministic-Constructive","publication_year":2011,"publication_date":"2011-03-24","ids":{"openalex":"https://openalex.org/W2126482858","doi":"https://doi.org/10.37236/551","mag":"2126482858"},"language":"en","primary_location":{"id":"doi:10.37236/551","is_oa":true,"landing_page_url":"https://doi.org/10.37236/551","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p64/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/v18i1p64/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108797971","display_name":"William Gasarch","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William Gasarch","raw_affiliation_strings":["Department of Computer Science University of Maryland at College Park College Park, MD 20742, USA","University of Maryland, College Park"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science University of Maryland at College Park College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"University of Maryland, College Park","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["CSAIL Massachusetts Institute of Technology Cambridge, MA 02130, USA","Massachusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CSAIL Massachusetts Institute of Technology Cambridge, MA 02130, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7917,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.83291771,"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.9987999796867371,"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.9983999729156494,"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/van-der-waerdens-theorem","display_name":"Van der Waerden's theorem","score":0.9318537712097168},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.9293180704116821},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.7659976482391357},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7517691850662231},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.627116858959198},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.6248053908348083},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.569764256477356},{"id":"https://openalex.org/keywords/monochromatic-color","display_name":"Monochromatic color","score":0.5296062231063843},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4632256031036377},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.41345033049583435},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1520417034626007}],"concepts":[{"id":"https://openalex.org/C116493835","wikidata":"https://www.wikidata.org/wiki/Q764287","display_name":"Van der Waerden's theorem","level":2,"score":0.9318537712097168},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.9293180704116821},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.7659976482391357},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7517691850662231},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.627116858959198},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.6248053908348083},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.569764256477356},{"id":"https://openalex.org/C40833965","wikidata":"https://www.wikidata.org/wiki/Q6901438","display_name":"Monochromatic color","level":2,"score":0.5296062231063843},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4632256031036377},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.41345033049583435},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1520417034626007},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","level":1,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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.37236/551","is_oa":true,"landing_page_url":"https://doi.org/10.37236/551","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p64/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/551","is_oa":true,"landing_page_url":"https://doi.org/10.37236/551","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p64/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":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2126482858.pdf","grobid_xml":"https://content.openalex.org/works/W2126482858.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1490170438","https://openalex.org/W1638203394","https://openalex.org/W1991107293","https://openalex.org/W1993449345","https://openalex.org/W1995117763","https://openalex.org/W1996516812","https://openalex.org/W1998918799","https://openalex.org/W2006825591","https://openalex.org/W2008120342","https://openalex.org/W2016357085","https://openalex.org/W2019883273","https://openalex.org/W2021482277","https://openalex.org/W2041110868","https://openalex.org/W2052285731","https://openalex.org/W2062855793","https://openalex.org/W2067189483","https://openalex.org/W2070496958","https://openalex.org/W2094054391","https://openalex.org/W2107415439","https://openalex.org/W2109693504","https://openalex.org/W2132833941","https://openalex.org/W2166554108","https://openalex.org/W2335400162","https://openalex.org/W2569854318","https://openalex.org/W2752061190","https://openalex.org/W2752853835","https://openalex.org/W2798428635","https://openalex.org/W4212782960","https://openalex.org/W6652029856","https://openalex.org/W6750917982"],"related_works":["https://openalex.org/W2417925590","https://openalex.org/W4299420063","https://openalex.org/W76737142","https://openalex.org/W2949915340","https://openalex.org/W4224943664","https://openalex.org/W2959217929","https://openalex.org/W4221036368","https://openalex.org/W4242866892","https://openalex.org/W1998171255","https://openalex.org/W84644661"],"abstract_inverted_index":{"The":[0,27],"van":[1,39],"der":[2,40],"Waerden":[3,41],"number":[4],"$W(k,2)$":[5,47,153],"is":[6,36],"the":[7,67,74,82,147,167,176],"smallest":[8],"integer":[9],"$n$":[10,18,32],"such":[11,30,103],"that":[12,87,120],"every":[13],"$2$-coloring":[14,86],"of":[15,24,29,61,84,93,108,141,179,188],"1":[16],"to":[17,38,101,117,193],"has":[19,88],"a":[20,85,104,186],"monochromatic":[21,90],"arithmetic":[22,91],"progression":[23,92],"length":[25,94],"$k$.":[26],"existence":[28,83],"an":[31,122],"for":[33,133,210],"any":[34],"$k$":[35,95],"due":[37],"but":[42],"known":[43,160],"upper":[44],"bounds":[45,57,151],"on":[46,58,149,152,166],"are":[48,110],"enormous.":[49],"Much":[50],"effort":[51],"was":[52],"put":[53],"into":[54,197],"developing":[55],"lower":[56,63,150,162],"$W(k,2)$.":[59],"Most":[60],"these":[62,79,128,195,211],"bound":[64,163],"proofs":[65,80,109,119,137,164,196,207],"employ":[66],"probabilistic":[68],"method":[69],"often":[70,111],"in":[71,115,154],"combination":[72],"with":[73],"Lov\u00e1sz":[75,168],"Local":[76,169],"Lemma.":[77],"While":[78],"show":[81,158],"no":[89,98],"they":[96],"provide":[97,121,201],"efficient":[99,123],"algorithm":[100],"find":[102],"coloring.":[105],"These":[106],"kind":[107],"informally":[112],"called":[113],"nonconstructive":[114,161],"contrast":[116],"constructive":[118,142],"algorithm.":[124],"This":[125],"paper":[126],"clarifies":[127],"notions":[129],"and":[130,135,181,191,204,208],"gives":[131],"definitions":[132],"deterministic-":[134],"randomized-constructive":[136,174],"as":[138],"different":[139],"types":[140],"proofs.":[143,199],"We":[144,157,183,200],"then":[145],"survey":[146],"literature":[148],"this":[155],"light.":[156],"how":[159],"based":[165],"Lemma":[170],"can":[171],"be":[172],"made":[173],"using":[175],"recent":[177],"algorithms":[178],"Moser":[180],"Tardos.":[182],"also":[184],"use":[185],"derandomization":[187],"Chandrasekaran,":[189],"Goyal":[190],"Haeupler":[192],"transform":[194],"deterministic-constructive":[198],"greatly":[202],"simplified":[203],"fully":[205],"self-contained":[206],"descriptions":[209],"algorithms.":[212]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}