{"id":"https://openalex.org/W4241497605","doi":"https://doi.org/10.1002/jgt.3190070115","title":"On size Ramsey number of paths, trees, and circuits. I","display_name":"On size Ramsey number of paths, trees, and circuits. I","publication_year":1983,"publication_date":"1983-03-01","ids":{"openalex":"https://openalex.org/W4241497605","doi":"https://doi.org/10.1002/jgt.3190070115"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190070115","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190070115","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047375371","display_name":"J\u00f3zsef Beck","orcid":"https://orcid.org/0000-0002-5428-8818"},"institutions":[{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"government","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"J\u00f3Zsef Beck","raw_affiliation_strings":["Mathematical Institute of The Hungarian Academy of Sciences Budapest, Realtanoda U. 13\u201315. H-1053, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Institute of The Hungarian Academy of Sciences Budapest, Realtanoda U. 13\u201315. H-1053, Hungary","institution_ids":["https://openalex.org/I7597260"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5047375371"],"corresponding_institution_ids":["https://openalex.org/I7597260"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":1.5322,"has_fulltext":false,"cited_by_count":109,"citation_normalized_percentile":{"value":0.83944954,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"7","issue":"1","first_page":"115","last_page":"129"},"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.9976000189781189,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ramseys-theorem","display_name":"Ramsey's theorem","score":0.9261910915374756},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8522089719772339},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8276704549789429},{"id":"https://openalex.org/keywords/monochromatic-color","display_name":"Monochromatic color","score":0.6357859373092651},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5410088896751404},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5223031044006348},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.480185866355896},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4577021598815918},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.05668747425079346}],"concepts":[{"id":"https://openalex.org/C44115641","wikidata":"https://www.wikidata.org/wiki/Q918099","display_name":"Ramsey's theorem","level":3,"score":0.9261910915374756},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8522089719772339},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8276704549789429},{"id":"https://openalex.org/C40833965","wikidata":"https://www.wikidata.org/wiki/Q6901438","display_name":"Monochromatic color","level":2,"score":0.6357859373092651},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5410088896751404},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5223031044006348},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.480185866355896},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4577021598815918},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.05668747425079346},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/jgt.3190070115","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190070115","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"},{"id":"pmh:oai:alma.01RUT_INST:11665010600004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/journalArticle/On-size-Ramsey-number-of-paths/991031665878304646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"Open Research (University of Surrey)","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W129769633","https://openalex.org/W1552744309","https://openalex.org/W1569752386","https://openalex.org/W2009232680","https://openalex.org/W2042587503","https://openalex.org/W2051336598","https://openalex.org/W2164302265","https://openalex.org/W2169821423"],"related_works":["https://openalex.org/W2951614720","https://openalex.org/W4301078840","https://openalex.org/W4323065312","https://openalex.org/W2516261732","https://openalex.org/W3038691421","https://openalex.org/W2891286913","https://openalex.org/W3101000895","https://openalex.org/W1966595665","https://openalex.org/W2582950667","https://openalex.org/W3037609754"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"size":[2,51,84],"Ramsey":[3,52,85],"number":[4,53],"\u0159":[5,17,26],"(":[6],"G":[7,12,44],")":[8,57],"of":[9,25,34,37,43,58,63,74,87],"a":[10,22,40,72,79],"graph":[11,23],"is":[13,21,66],"the":[14,29,35,50,59],"smallest":[15],"integer":[16],"such":[18],"that":[19,31,49],"there":[20],"F":[24,38],"edges":[27,36],"with":[28],"property":[30],"any":[32],"two\u2010coloring":[33],"yields":[39],"monochromatic":[41],"copy":[42],".":[45],"First":[46],"we":[47,77],"show":[48],"\u0159(":[54],"P":[55,61],"n":[56,62,65,69],"path":[60],"length":[64],"linear":[67],"in":[68],",":[70],"solving":[71],"problem":[73],"Erd\u00f6s.":[75],"Second":[76],"present":[78],"general":[80],"upper":[81],"bound":[82],"on":[83],"numbers":[86],"trees.":[88]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}