| Budget Amount *help |
¥4,940,000 (Direct Cost: ¥3,800,000、Indirect Cost: ¥1,140,000)
Fiscal Year 2016: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2015: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2014: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2013: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Outline of Final Research Achievements |
For a set F of finite connected graphs, a graph G is said to be F-free if G does not contain an induced subgraph which is isomorphic to any member of F. The set F is often referred as forbidden subgraphs. In this research, we have constructed infinite sequences of graphs consisting of graphs with relatively high symmetry, and studied induced subgraphs commonly contained in each member of the sequences. This has led us to establish a common methods which are applicable to a number of studies on forbidden subgraphs. Then we have applied these methods and solved several problems concerning forbidden subgraphs and demonstrated the effectiveness of these methods.
|
