A study on invariants that guarantee the existence of cycles and trees
| Project/Area Number |
24740074
|
|---|
| 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 | Kinki University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2012-04-01 – 2016-03-31
|
| Project Status |
Completed (Fiscal Year 2015)
|
| Budget Amount *help |
¥2,860,000 (Direct Cost: ¥2,200,000、Indirect Cost: ¥660,000)
Fiscal Year 2015: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2014: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2013: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2012: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
|
|---|
| Keywords | ハミルトン閉路 / 次数和条件 / 全域木 / 閉路 |
|---|
| Outline of Final Research Achievements |
In 2008, Ozeki and I discovered a rule of a degree sum condition with the order, the connectivity and the independence number of a graph for the existence of a hamiltonian cycle. The rule is that the lower bound on the degree condition is an arithmetic progression with common difference of ``the independence number - 1''.
We proved that the rule holds for degree sum condition of two, three or four vertices, and conjectured the rule holds for degree sum condition of at least five vertices. Moreover, we posed a similar conjecture for the circumference. For these two conjectures, we settled the conjecture on hamiltonicity, and the conjecture on circumference for a degree sum condition of four vertices.
|
Report
(5 results)
Research Products
(16 results)
