| Budget Amount *help |
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2010: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2009: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2008: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2007: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Research Abstract |
A theorem in graph theory called Szemeredi's regularity lemma is known to be useful in many combinatorial problems including additive number theory and others. This theorem has been expanded in a simple form. In previously known versions of this theorem, the constructions of the desired decompositions was obtained by repeating a complicated process. In this version, the desired decomposition is obtained almost surely by a one-time simple random sampling. By utilizing this advantage, this theorem is applied to several problems and its power is demonstrated.
|
