{"id":"https://openalex.org/W2949188192","doi":"https://doi.org/10.37236/1794","title":"Satisfiability and Computing van der Waerden Numbers","display_name":"Satisfiability and Computing van der Waerden Numbers","publication_year":2004,"publication_date":"2004-06-16","ids":{"openalex":"https://openalex.org/W2949188192","doi":"https://doi.org/10.37236/1794","mag":"2949188192"},"language":"en","primary_location":{"id":"doi:10.37236/1794","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1794","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v11i1r41/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/v11i1r41/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069363884","display_name":"Michael R. Dransfield","orcid":null},"institutions":[{"id":"https://openalex.org/I130440993","display_name":"National Security Agency","ror":"https://ror.org/0047bvr32","country_code":"US","type":"government","lineage":["https://openalex.org/I130440993","https://openalex.org/I1330347796"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael R. Dransfield","raw_affiliation_strings":["National Security Agency Information Assurance Directorate Ft. Meade, MD 20755"],"affiliations":[{"raw_affiliation_string":"National Security Agency Information Assurance Directorate Ft. Meade, MD 20755","institution_ids":["https://openalex.org/I130440993"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064243505","display_name":"Lengning Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lengning Liu","raw_affiliation_strings":["Department of Computer Science University of Kentucky Lexington, KY 40506-0046"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science University of Kentucky Lexington, KY 40506-0046","institution_ids":["https://openalex.org/I143302722"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048411051","display_name":"Victor W. Marek","orcid":"https://orcid.org/0000-0002-1369-5177"},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Victor W. Marek","raw_affiliation_strings":["Department of Computer Science University of Kentucky Lexington, KY 40506-0046"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science University of Kentucky Lexington, KY 40506-0046","institution_ids":["https://openalex.org/I143302722"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079794036","display_name":"Miros\u0142aw Truszczy\u0144ski","orcid":"https://orcid.org/0000-0001-7277-1232"},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Miros\u0142aw Truszczy\u0144ski","raw_affiliation_strings":["Department of Computer Science University of Kentucky Lexington, KY 40506-0046"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science University of Kentucky Lexington, KY 40506-0046","institution_ids":["https://openalex.org/I143302722"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5069363884"],"corresponding_institution_ids":["https://openalex.org/I130440993"],"apc_list":null,"apc_paid":null,"fwci":3.1108,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.91662627,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"11","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.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.9976999759674072,"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.996399998664856,"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.9691578149795532},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7396241426467896},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6858662366867065},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6822597980499268},{"id":"https://openalex.org/keywords/ramsey-theory","display_name":"Ramsey theory","score":0.6577323079109192},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.49412110447883606},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4762002229690552},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4604871869087219},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.45897573232650757},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4219111502170563},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.229933500289917}],"concepts":[{"id":"https://openalex.org/C116493835","wikidata":"https://www.wikidata.org/wiki/Q764287","display_name":"Van der Waerden's theorem","level":2,"score":0.9691578149795532},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7396241426467896},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6858662366867065},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6822597980499268},{"id":"https://openalex.org/C112291201","wikidata":"https://www.wikidata.org/wiki/Q1336170","display_name":"Ramsey theory","level":2,"score":0.6577323079109192},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.49412110447883606},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4762002229690552},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4604871869087219},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.45897573232650757},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4219111502170563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.229933500289917},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/1794","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1794","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v11i1r41/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/1794","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1794","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v11i1r41/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":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G8703471386","display_name":"ITR:     Decision-Theoretic Planning with Constraints","funder_award_id":"0325063","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8932419544","display_name":"Nonmonotonic Reasoning and Computational Knowledge Representation","funder_award_id":"0097278","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"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2949188192.pdf","grobid_xml":"https://content.openalex.org/works/W2949188192.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W185426153","https://openalex.org/W1511155470","https://openalex.org/W1556434751","https://openalex.org/W1996516812","https://openalex.org/W2002353129","https://openalex.org/W2038121735","https://openalex.org/W2041110868","https://openalex.org/W2041526687","https://openalex.org/W2048051309","https://openalex.org/W2062897452","https://openalex.org/W2067189483","https://openalex.org/W2085301456","https://openalex.org/W2095689360","https://openalex.org/W2165372647","https://openalex.org/W2949188192","https://openalex.org/W4233090747","https://openalex.org/W4249824762","https://openalex.org/W4252072050","https://openalex.org/W6669778933","https://openalex.org/W6684615325"],"related_works":["https://openalex.org/W2076721162","https://openalex.org/W2081918372","https://openalex.org/W1522191817","https://openalex.org/W2996901643","https://openalex.org/W2327497304","https://openalex.org/W2952114041","https://openalex.org/W2949188192","https://openalex.org/W1900663752","https://openalex.org/W1979936864","https://openalex.org/W2613772070"],"abstract_inverted_index":{"In":[0],"this":[1,102,152],"paper":[2],"we":[3,61,114],"bring":[4],"together":[5],"the":[6,19,50,83,124],"areas":[7],"of":[8,21,40,52,126,156,163],"combinatorics":[9],"and":[10,35,95,144,161],"propositional":[11,71,100,147],"satisfiability.":[12],"Many":[13],"combinatorial":[14],"theorems":[15],"establish,":[16],"often":[17],"constructively,":[18],"existence":[20],"positive":[22],"integer":[23],"functions,":[24],"without":[25],"actually":[26],"providing":[27],"their":[28,80,138,141],"closed":[29],"algebraic":[30],"form":[31],"or":[32],"tight":[33],"lower":[34],"upper":[36],"bounds.":[37],"The":[38],"area":[39],"Ramsey":[41],"theory":[42],"is":[43],"especially":[44,140],"rich":[45],"in":[46,73,86,151,158],"such":[47,74],"results.":[48],"Using":[49],"problem":[51,125],"computing":[53,127],"van":[54,128],"der":[55,129],"Waerden":[56,130],"numbers":[57,84],"as":[58],"an":[59],"example,":[60],"show":[62,89],"that":[63,77,90,135,149],"these":[64],"problems":[65],"can":[66,154],"be":[67,155],"represented":[68],"by":[69,91],"parameterized":[70],"theories":[72,148],"a":[75],"way":[76],"decisions":[78],"concerning":[79],"satisfiability":[81],"determine":[82],"(function)":[85],"question.":[87],"We":[88,132],"using":[92],"general-purpose":[93],"complete":[94],"local-search":[96],"techniques":[97],"for":[98],"testing":[99,160],"satisfiability,":[101],"approach":[103],"becomes":[104],"effective":[105],"\u2014":[106],"competitive":[107],"with":[108],"specialized":[109],"approaches.":[110],"By":[111],"following":[112],"it,":[113],"were":[115],"able":[116],"to":[117,123,137],"obtain":[118],"several":[119],"new":[120],"results":[121],"pertaining":[122],"numbers.":[131],"also":[133],"note":[134],"due":[136],"properties,":[139],"structural":[142],"simplicity":[143],"computational":[145],"hardness,":[146],"arise":[150],"research":[153],"use":[157],"development,":[159],"benchmarking":[162],"SAT":[164],"solvers.":[165]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}