A study on Ramsey-type problem concerning cycle partitions in graphs
Project/Area Number |
23740095
|
Research Category |
Grant-in-Aid for Young Scientists (B)
|
Allocation Type | Multi-year Fund |
Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
Research Institution | Yokohama City University (2013-2014) Maebashi Institute of Technology (2012) Gunma National College of Technology (2011) |
Principal Investigator |
FUJITA Shinya 横浜市立大学, 国際総合科学部, 准教授 (60424206)
|
Project Period (FY) |
2011-04-28 – 2015-03-31
|
Project Status |
Completed (Fiscal Year 2014)
|
Budget Amount *help |
¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2014: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2013: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2012: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2011: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
|
Keywords | グラフのラムゼー数 / グラフの閉路 / グラフの辺着色 / 極値グラフ理論 / ハイパーグラフ / グラフの極値問題 / 国際情報交換 / ハンガリー / 国際研究者交流 |
Outline of Final Research Achievements |
In this study, I worked on a conjecture concerning cycle partitions in graphs, which is an important unsolved problem in graph (Ramsey) theory. As a result, although I could not solve this conjecture completely, I obtained some partial results towards the conjecture and also obtained many important results in graph theory. In particular, I could give a substantial contribution to the study of cycles in graphs.
|
Report
(5 results)
Research Products
(32 results)