On Thomassen's conjecture and 2-factors of claw-free graphs
| Project/Area Number |
22540152
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
|---|
| Research Institution | Nihon University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2010-04-01 – 2014-03-31
|
| Project Status |
Completed (Fiscal Year 2013)
|
| Budget Amount *help |
¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2013: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2012: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2011: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2010: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
|---|
| Keywords | グラフ理論 / ハミルトンサイクル / Thomassen予想 / ２因子 / ライングラフ / クローフリーグラフ / ３正則グラフ / 国際情報交換 / claw-freeグラフ / Tutteサイクル / dominating偶部分グラフ / Jackson予想 / Tutte閉トレイル / 2因子 / 支配的サイクル / 線グラフ / Thomassenの予想 / 最大独立数 / 連結度 / Ryjacek閉包 |
|---|
| Research Abstract |
First, we studied the upper bounds of the number of components of 2-factors of low-connected line graphs, which are given by using the maximum independence number. And we got the following result: a 3-connected claw-free graph has a 2-factor in which the number of components is at most 2a/5, where a is the maximum independence number. Next we considered cubic graphs, which is very important family of graphs for Thomassen's conjecture and many important problems and conjectures in Graph theory. And we showed that if Bondy's conjecture on cubic graphs holds, then Thomassen's conjecture holds for the case of the minimum degree at least five.
|
Report
(5 results)
Research Products
(22 results)
