{"id":"https://openalex.org/W1542986919","doi":"https://doi.org/10.37236/511","title":"On Multicolor Ramsey Number of Paths Versus Cycles","display_name":"On Multicolor Ramsey Number of Paths Versus Cycles","publication_year":2011,"publication_date":"2011-01-26","ids":{"openalex":"https://openalex.org/W1542986919","doi":"https://doi.org/10.37236/511","mag":"1542986919"},"language":"en","primary_location":{"id":"doi:10.37236/511","is_oa":true,"landing_page_url":"https://doi.org/10.37236/511","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p24/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/v18i1p24/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108354135","display_name":"G.R. Omidi","orcid":null},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Gholam Reza Omidi","raw_affiliation_strings":["Isfahan university of technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Isfahan university of technology","institution_ids":["https://openalex.org/I170013655"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028001091","display_name":"Ghaffar Raeisi","orcid":"https://orcid.org/0000-0003-0313-8059"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Ghaffar Raeisi","raw_affiliation_strings":["Isfahan university of technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Isfahan university of technology","institution_ids":["https://openalex.org/I170013655"]}]}],"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":7,"citation_normalized_percentile":{"value":0.805798,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"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.9919000267982483,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9902999997138977,"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.9158594012260437},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7954572439193726},{"id":"https://openalex.org/keywords/ramseys-theorem","display_name":"Ramsey's theorem","score":0.7784041166305542},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7403016090393066},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.645075798034668},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5526024103164673},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5369282960891724},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5099376440048218},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3688909411430359}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9158594012260437},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7954572439193726},{"id":"https://openalex.org/C44115641","wikidata":"https://www.wikidata.org/wiki/Q918099","display_name":"Ramsey's theorem","level":3,"score":0.7784041166305542},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7403016090393066},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.645075798034668},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5526024103164673},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5369282960891724},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5099376440048218},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3688909411430359},{"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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/511","is_oa":true,"landing_page_url":"https://doi.org/10.37236/511","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p24/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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.601.3835","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.601.3835","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.emis.de/journals/EJC/Volume_18/PDF/v18i1p24.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/511","is_oa":true,"landing_page_url":"https://doi.org/10.37236/511","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p24/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/W1542986919.pdf","grobid_xml":"https://content.openalex.org/works/W1542986919.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1505944160","https://openalex.org/W1544156472","https://openalex.org/W1604945782","https://openalex.org/W1990486130","https://openalex.org/W1996106086","https://openalex.org/W2031273169","https://openalex.org/W2039652996","https://openalex.org/W2042340160","https://openalex.org/W2047325782","https://openalex.org/W2047962811","https://openalex.org/W2095689360","https://openalex.org/W2275005719","https://openalex.org/W3151127145","https://openalex.org/W4300303686","https://openalex.org/W6833491830"],"related_works":["https://openalex.org/W2963272825","https://openalex.org/W1971174658","https://openalex.org/W2036810061","https://openalex.org/W2099195351","https://openalex.org/W2149859310","https://openalex.org/W4256429076","https://openalex.org/W2012063272","https://openalex.org/W2348092930","https://openalex.org/W2174974817","https://openalex.org/W2072510267"],"abstract_inverted_index":{"Let":[0],"$G_1,":[1],"G_2,":[2,14],"G_3,":[3],"\\ldots":[4],",":[5],"G_t$":[6],"be":[7],"graphs.":[8],"The":[9],"multicolor":[10],"Ramsey":[11],"number":[12],"$R(G_1,":[13],"\\ldots,":[15],"G_t)$":[16],"is":[17,104,114],"the":[18,26,60,76,105],"smallest":[19],"positive":[20],"integer":[21],"$n$":[22],"such":[23],"that":[24,100],"if":[25],"edges":[27],"of":[28,63,70,79,108],"a":[29,50,90],"complete":[30],"graph":[31],"$K_n$":[32],"are":[33,85],"partitioned":[34],"into":[35],"$t$":[36,41],"disjoint":[37],"color":[38],"classes":[39],"giving":[40],"graphs":[42],"$H_1,H_2,\\ldots,H_t$,":[43],"then":[44],"at":[45],"least":[46],"one":[47],"$H_i$":[48],"has":[49],"subgraph":[51],"isomorphic":[52],"to":[53],"$G_i$.":[54],"In":[55,74],"this":[56,101,109,117],"paper,":[57],"we":[58,88,98],"provide":[59],"exact":[61,77,106],"value":[62,107],"$R(P_{n_1},":[64],"P_{n_2},\\ldots,":[65],"P_{n_t},C_k)$":[66],"for":[67,93,116],"certain":[68],"values":[69,78],"$n_i$":[71],"and":[72,83,97],"$k$.":[73],"addition,":[75],"$R(P_5,C_4,P_k)$,":[80],"$R(P_4,C_4,P_k)$,":[81],"$R(P_5,P_5,P_k)$":[82],"$R(P_5,P_6,P_k)$":[84],"given.":[86],"Finally,":[87],"give":[89],"lower":[91,102],"bound":[92,103],"$R(P_{2n_1},":[94],"P_{2n_2},\\ldots,":[95],"P_{2n_t})$":[96],"conjecture":[99],"number.":[110],"Moreover,":[111],"some":[112],"evidence":[113],"given":[115],"conjecture.":[118]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}