| Project/Area Number |
16K05262
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Foundations of mathematics/Applied mathematics
|
|---|
| Research Institution | Kindai University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2016-04-01 – 2023-03-31
|
| Project Status |
Completed (Fiscal Year 2022)
|
| Budget Amount *help |
¥3,250,000 (Direct Cost: ¥2,500,000、Indirect Cost: ¥750,000)
Fiscal Year 2020: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2019: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2018: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2017: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2016: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
|
|---|
| Keywords | 閉路 / 次数条件 / グラフ理論 / 離散数学 / 組合せ論 |
|---|
| Outline of Final Research Achievements |
Chiba and I wrote a survey paper on degree conditions for the existence of a specified number of cycles or paths in a graph. In the process, we obtained three results on degree-sum conditions for partitioning a graph into cycles. With Chen, Chiba, Gould, Gu, Saito, and Tsugaki, I proved that dense graphs have dense bipartite graphs as substructures in terms of degree sums of non-adjacent two-vertices. In work with Ota and Chiba, I obtained a result that is a common generalization of Bondy and Vince's conjecture on the distribution of cycle lengths (in 1998) and a conjecture by Ma et al. (in 2018).
|
| Academic Significance and Societal Importance of the Research Achievements |
小関氏との共著である2008年の論文で，ハミルトン閉路が存在するための次数和条件に関して，その最良の下限は公差が「独立数－1」の等差数列をなすという予想をした．津垣氏，小関氏，千葉氏，古谷氏と共同研究で，未解決であったこの予想を解決し，2019年に論文として掲載された．千葉氏と執筆した，指定された個数の閉路または道がグラフに存在するための次数条件についてのサーヴェイ論文は，2018年1月に国際雑誌に掲載され，2023年5月現在1259回アクセスされていて，11本の論文で引用されている．
|
