涉及匹配的受限大小Ramsey数与五阶图

IF 0.5 Q4 MULTIDISCIPLINARY SCIENCES

Journal of Mathematical and Fundamental Sciences Pub Date : 2020-09-01 DOI:10.5614/j.math.fund.sci.2020.52.2.1

D. R. Silaban, E. Baskoro, S. Uttunggadewa

{"title":"涉及匹配的受限大小Ramsey数与五阶图","authors":"D. R. Silaban, E. Baskoro, S. Uttunggadewa","doi":"10.5614/j.math.fund.sci.2020.52.2.1","DOIUrl":null,"url":null,"abstract":"Harary and Miller (1983) started the research on the (restricted) size Ramsey number for a pair of small graphs. They obtained the values for some pairs of small graphs with order not more than four. In the same year, Faudree and Sheehan continued the research and extended the result to all pairs of small graphs with order not more than four. Moreover, in 1998, Lortz and Mengenser gave the size Ramsey number and the restricted size Ramsey number for all pairs of small forests with order not more than five. Recently, we gave the restricted size Ramsey number for a path of order three and any connected graph of order five. In this paper, we continue the research on the (restricted) size Ramsey number involving small graphs by investigating the restricted size Ramsey number for matching with two edges versus any graph of order five with no isolates.","PeriodicalId":16255,"journal":{"name":"Journal of Mathematical and Fundamental Sciences","volume":"4 1","pages":"133-142"},"PeriodicalIF":0.5000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Restricted Size Ramsey Number Involving Matching and Graph of Order Five\",\"authors\":\"D. R. Silaban, E. Baskoro, S. Uttunggadewa\",\"doi\":\"10.5614/j.math.fund.sci.2020.52.2.1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Harary and Miller (1983) started the research on the (restricted) size Ramsey number for a pair of small graphs. They obtained the values for some pairs of small graphs with order not more than four. In the same year, Faudree and Sheehan continued the research and extended the result to all pairs of small graphs with order not more than four. Moreover, in 1998, Lortz and Mengenser gave the size Ramsey number and the restricted size Ramsey number for all pairs of small forests with order not more than five. Recently, we gave the restricted size Ramsey number for a path of order three and any connected graph of order five. In this paper, we continue the research on the (restricted) size Ramsey number involving small graphs by investigating the restricted size Ramsey number for matching with two edges versus any graph of order five with no isolates.\",\"PeriodicalId\":16255,\"journal\":{\"name\":\"Journal of Mathematical and Fundamental Sciences\",\"volume\":\"4 1\",\"pages\":\"133-142\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2020-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Mathematical and Fundamental Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5614/j.math.fund.sci.2020.52.2.1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MULTIDISCIPLINARY SCIENCES\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Mathematical and Fundamental Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5614/j.math.fund.sci.2020.52.2.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MULTIDISCIPLINARY SCIENCES","Score":null,"Total":0}

引用次数: 3

摘要

Harary和Miller(1983)开始研究一对小图的(受限)大小Ramsey数。他们得到了一些阶数不超过4的小图对的值。同年，Faudree和Sheehan继续研究，并将结果推广到所有阶数不超过4的小图对。此外，Lortz和Mengenser(1998)给出了所有阶数不大于5的小森林对的大小Ramsey数和限制大小Ramsey数。最近，我们给出了3阶路径和任意5阶连通图的受限大小Ramsey数。在本文中，我们通过研究与任意无隔离的五阶图的两条边匹配的限制大小Ramsey数，继续研究涉及小图的(限制)大小Ramsey数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Restricted Size Ramsey Number Involving Matching and Graph of Order Five

Harary and Miller (1983) started the research on the (restricted) size Ramsey number for a pair of small graphs. They obtained the values for some pairs of small graphs with order not more than four. In the same year, Faudree and Sheehan continued the research and extended the result to all pairs of small graphs with order not more than four. Moreover, in 1998, Lortz and Mengenser gave the size Ramsey number and the restricted size Ramsey number for all pairs of small forests with order not more than five. Recently, we gave the restricted size Ramsey number for a path of order three and any connected graph of order five. In this paper, we continue the research on the (restricted) size Ramsey number involving small graphs by investigating the restricted size Ramsey number for matching with two edges versus any graph of order five with no isolates.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Mathematical and Fundamental Sciences MULTIDISCIPLINARY SCIENCES-

CiteScore

1.30

自引率

0.00%

发文量

审稿时长

24 weeks

期刊介绍： Journal of Mathematical and Fundamental Sciences welcomes full research articles in the area of Mathematics and Natural Sciences from the following subject areas: Astronomy, Chemistry, Earth Sciences (Geodesy, Geology, Geophysics, Oceanography, Meteorology), Life Sciences (Agriculture, Biochemistry, Biology, Health Sciences, Medical Sciences, Pharmacy), Mathematics, Physics, and Statistics. New submissions of mathematics articles starting in January 2020 are required to focus on applied mathematics with real relevance to the field of natural sciences. Authors are invited to submit articles that have not been published previously and are not under consideration elsewhere.