{"id":"https://openalex.org/W2893607610","doi":"https://doi.org/10.1017/s0963548320000036","title":"On minimal Ramsey graphs and Ramsey equivalence in multiple colours","display_name":"On minimal Ramsey graphs and Ramsey equivalence in multiple colours","publication_year":2020,"publication_date":"2020-03-09","ids":{"openalex":"https://openalex.org/W2893607610","doi":"https://doi.org/10.1017/s0963548320000036","mag":"2893607610"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548320000036","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548320000036","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1809.09232","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Dennis Clemens","orcid":null},"institutions":[{"id":"https://openalex.org/I884043246","display_name":"Hamburg University of Technology","ror":"https://ror.org/04bs1pb34","country_code":"DE","type":"education","lineage":["https://openalex.org/I884043246"]},{"id":"https://openalex.org/I159176309","display_name":"Universit\u00e4t Hamburg","ror":"https://ror.org/00g30e956","country_code":"DE","type":"education","lineage":["https://openalex.org/I159176309"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dennis Clemens","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Technische Universit\u00e4t Hamburg, 21073 Hamburg, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Technische Universit\u00e4t Hamburg, 21073 Hamburg, Germany","institution_ids":["https://openalex.org/I159176309","https://openalex.org/I884043246"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Anita Liebenau","orcid":null},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Anita Liebenau","raw_affiliation_strings":["School of Mathematics and Statistics, UNSW Sydney, Sydney NSW 2052, Australia"],"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, UNSW Sydney, Sydney NSW 2052, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"last","author":{"id":null,"display_name":"Damian Reding","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Damian Reding","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I31746571"],"apc_list":null,"apc_paid":null,"fwci":1.6516,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78393524,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"29","issue":"4","first_page":"537","last_page":"554"},"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.8525000214576721,"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.8525000214576721,"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.07919999957084656,"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.05090000107884407,"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/cograph","display_name":"Cograph","score":0.6243000030517578},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.5648999810218811},{"id":"https://openalex.org/keywords/antichain","display_name":"Antichain","score":0.4562999904155731},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.41370001435279846},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4049000144004822},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.40470001101493835},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.4002000093460083},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.3930000066757202},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3772999942302704}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8116000294685364},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7653999924659729},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.6243000030517578},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.5648999810218811},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5404000282287598},{"id":"https://openalex.org/C136134351","wikidata":"https://www.wikidata.org/wiki/Q431937","display_name":"Antichain","level":3,"score":0.4562999904155731},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.41370001435279846},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4049000144004822},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.40470001101493835},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.4002000093460083},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.3930000066757202},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3772999942302704},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.3513000011444092},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.3450999855995178},{"id":"https://openalex.org/C68103157","wikidata":"https://www.wikidata.org/wiki/Q569347","display_name":"Graph product","level":5,"score":0.3382999897003174},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.3375999927520752},{"id":"https://openalex.org/C44115641","wikidata":"https://www.wikidata.org/wiki/Q918099","display_name":"Ramsey's theorem","level":3,"score":0.33629998564720154},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.33390000462532043},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.33009999990463257},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.289000004529953},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.2858000099658966},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.2825999855995178},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.26030001044273376},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.2556000053882599}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548320000036","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548320000036","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"},{"id":"pmh:oai:arXiv.org:1809.09232","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1809.09232","pdf_url":"https://arxiv.org/pdf/1809.09232","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/unsworks_75922","is_oa":true,"landing_page_url":"http://hdl.handle.net/1959.4/unsworks_75922","pdf_url":null,"source":{"id":"https://openalex.org/S4306401737","display_name":"UNSWorks (University of New South Wales, Sydney, Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40053085","host_organization_name":"Australian Defence Force Academy","host_organization_lineage":["https://openalex.org/I40053085"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Combinatorics Probability and Computing, 29, 4, 537-554","raw_type":"http://purl.org/coar/resource_type/c_6501"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1809.09232","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1809.09232","pdf_url":"https://arxiv.org/pdf/1809.09232","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320971","display_name":"Monash University","ror":"https://ror.org/02bfwt286"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1640333354","https://openalex.org/W1864971073","https://openalex.org/W2004120849","https://openalex.org/W2028276181","https://openalex.org/W2030551570","https://openalex.org/W2030696417","https://openalex.org/W2034622005","https://openalex.org/W2038937017","https://openalex.org/W2045472305","https://openalex.org/W2050095135","https://openalex.org/W2051336598","https://openalex.org/W2091028431","https://openalex.org/W2095689360","https://openalex.org/W2155551829","https://openalex.org/W2161164202","https://openalex.org/W2164493894","https://openalex.org/W2768930897","https://openalex.org/W2795915197","https://openalex.org/W2963638264","https://openalex.org/W4234919473","https://openalex.org/W4236734508","https://openalex.org/W4248191427","https://openalex.org/W4253985608"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"For":[1,120,129,159],"an":[2,96,100,145,149,193,325],"integer":[3],"q":[4,12,20,37,54,73,84,104,134,153,161,166,212,242,255,259,268,272],"\u2a7e":[5,74,162,273],"2,":[6],"a":[7,15,28,60,79],"graph":[8,16,80,88,139,308],"G":[9,26,35,46,51,77,92],"is":[10,36,52,78,82,93,113,142,187,309,321],"called":[11,53,241],"-Ramsey":[13,38,85],"for":[14,39,56,72,86,107,140,156,169,214,257,270,284,324],"H":[17,32,40,57,89,108,112,122,141,157,170,185,215,235,238,249,252],"if":[18,76,260],"every":[19,136,160],"-colouring":[21],"of":[22,25,31,45,103,152,171,207,222,225,328],"the":[23,118,124,198,205,220,306,322],"edges":[24],"contains":[27],"monochromatic":[29],"copy":[30],".":[33,58,158,216],"If":[34],"yet":[41],"no":[42],"proper":[43],"subgraph":[44,98,147],"has":[47],"this":[48,287,320],"property,":[49],"then":[50,91],"-Ramsey-minimal":[55,105,138,154,167,213],"Generalizing":[59],"statement":[61],"by":[62,292,297],"Burr,":[63],"Ne\u0161et\u0159il":[64,293],"and":[65,177,237,251,264,294,296,302],"R\u00f6dl":[66,295],"from":[67],"1977,":[68],"we":[69,281],"prove":[70,318],"that,":[71],"3,":[75,163],"that":[81,210,246,265,283,305,319],"not":[83,276,310],"some":[87,127,271],",":[90,123,135,231],"contained":[94,143],"as":[95,109,111,144],"induced":[97,146],"in":[99,148,232,266],"infinite":[101,150],"number":[102,151,327],"graphs":[106,155,168,209,226,248,286],"long":[110],"3-connected":[114,188],"or":[115,189],"isomorphic":[116],"to":[117,197,312],"triangle.":[119],"such":[121],"following":[125],"are":[126,165,211,240,254,262],"consequences.":[128],"2":[130,239,253],"\u2a7d":[131],"r":[132,137],"<":[133],"there":[164],"arbitrarily":[172],"large":[173],"maximum":[174],"degree,":[175],"genus":[176],"chromatic":[178],"number.":[179],"The":[180],"collection":[181],"$\\{\\mathcal":[182],"M_q(H)":[183],"\\colon":[184],"\\text{":[186],"}":[190],"K_3\\}$":[191],"forms":[192],"antichain":[194],"with":[195],"respect":[196],"subset":[199],"relation,":[200],"where":[201],"$\\mathcal":[202,228],"M_q(H)$":[203],"denotes":[204],"set":[206],"all":[208],"We":[217,244,317],"also":[218],"address":[219],"question":[221],"which":[223,233],"pairs":[224],"satisfy":[227],"M_q(H_1)=\\mathcal":[229],"M_q(H_2)$":[230],"case":[234,323],"1":[236,250],"-equivalent.":[243],"show":[245],"two":[247],"-equivalent":[256],"even":[258],"they":[261],"2-equivalent,":[263],"general":[267],"-equivalence":[269],"3":[274],"does":[275],"necessarily":[277],"imply":[278,304],"2-equivalence.":[279],"Finally":[280],"indicate":[282],"connected":[285,315],"implication":[288],"may":[289],"hold:":[290],"results":[291],"Fox,":[298],"Grinshpun,":[299],"Liebenau,":[300],"Person":[301],"Szab\u00f3":[303],"complete":[307],"2-equivalent":[311],"any":[313],"other":[314],"graph.":[316],"arbitrary":[326],"colours.":[329]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2018-10-05T00:00:00"}