A STUDY ON PARTITION PROBLEMS IN HIGHLY CONNECTED GRAPHS AND FORBIDDEN SUBGRAPHS
| Project/Area Number |
20740068
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
|---|
| Research Institution | Gunma National College of Technology |
|---|
Principal Investigator |
FUJITA Shinya Gunma National College of Technology, 一般教科, 講師 (60424206)
|
|---|
| Project Period (FY) |
2009 – 2010
|
| Project Status |
Completed (Fiscal Year 2010)
|
| Budget Amount *help |
¥3,900,000 (Direct Cost: ¥3,000,000、Indirect Cost: ¥900,000)
Fiscal Year 2010: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2009: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2008: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
|
|---|
| Keywords | 組合せ論 / グラフ理論 / グラフの連結度 / 非分離部分グラフ / グラフの頂点分割 / グラフの連続度 / 禁止部分グラフ / 点素な部分グラフ |
|---|
| Research Abstract |
In this research, I focused on the Thomassen's conjecture concerning a partition problem in graph connectivity. I worked on this problem in view of the study on forbidden subgraphs and tried to get some partial results. As a result, I could obtain many nice results in this area.
|
Report
(4 results)
Research Products
(19 results)
