Standard methods for the study of forbidden subgraphs
Project/Area Number |
25330017
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Multi-year Fund |
Section | 一般 |
Research Field |
Theory of informatics
|
Research Institution | Nihon University |
Principal Investigator |
SAITO Akira 日本大学, 文理学部, 教授 (90186924)
|
Project Period (FY) |
2013-04-01 – 2017-03-31
|
Project Status |
Completed (Fiscal Year 2016)
|
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)
|
Keywords | 禁止部分グラフ / グラフ / ハミルトンサイクル / 因子 / グラフ理論 / マッチング / スター / 連結度 / 頂点彩色 / 縮約 / 離散数学 / 組合せ論 |
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.
|
Report
(5 results)
Research Products
(31 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Forbidden subgraphs and 2-factors2015
Author(s)
Akira Saito
Organizer
The Second Japan-Sino Symposium on Graph Theory, Combinatorics and Their Applications
Place of Presentation
東京理科大学(東京都・新宿区)
Year and Date
2015-11-03
Related Report
Int'l Joint Research / Invited
-
-
-
-
-
-
-
-
-