• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Study of Ramsey-type decomposition problems

Research Project

Project/Area Number 23540168
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeMulti-year Fund
Section一般
Research Field General mathematics (including Probability theory/Statistical mathematics)
Research InstitutionShonan Institute of Technology

Principal Investigator

NAKAMIGAWA Tomoki  湘南工科大学, 工学部, 准教授 (20386890)

Project Period (FY) 2011 – 2013
Project Status Completed (Fiscal Year 2013)
Budget Amount *help
¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2013: ¥390,000 (Direct Cost: ¥300,000、Indirect Cost: ¥90,000)
Fiscal Year 2012: ¥390,000 (Direct Cost: ¥300,000、Indirect Cost: ¥90,000)
Fiscal Year 2011: ¥390,000 (Direct Cost: ¥300,000、Indirect Cost: ¥90,000)
Keywordsラムゼー理論 / 極値グラフ理論 / グラフ分割 / 誘導部分グラフ / 離散数学 / 組合せ論
Research Abstract

Ramsey-type problems in discrete mathematics and combinatorics are to determine whether the following claims hold or not in various situations; any sufficiently large structure, however it is in disorder, has a local structure that is in order.
In this study, Ramsey-type partition problems are introduced. They are deeply connected with Ramsey-type problems, and our aim is to investigate the following claim; any sufficiently large structure, however it is in disorder, admits a partition that is in order. We have shown some theorems for the Ramsey-type partition problems of some discrete structures, such as graphs.

Report

(4 results)
  • 2013 Annual Research Report   Final Research Report ( PDF )
  • 2012 Research-status Report
  • 2011 Research-status Report
  • Research Products

    (27 results)

All 2014 2013 2012 2011 Other

All Journal Article (9 results) (of which Peer Reviewed: 4 results) Presentation (16 results) (of which Invited: 1 results) Remarks (2 results)

  • [Journal Article] A Ramsey-type theorem for multiple disjoint copies of induced subgraphs2014

    • Author(s)
      T. Nakamigawa
    • Journal Title

      Discussiones Mathematicae Graph Theory

      Volume: 34 Pages: 249-261

    • Related Report
      2013 Annual Research Report 2013 Final Research Report
  • [Journal Article] Pebble exchange on graphs2013

    • Author(s)
      S. Fujita, T. Nakamigawa and T. Sakuma
    • Journal Title

      Discrete Applied Mathematics

      Volume: 184 Pages: 139-145

    • DOI

      10.1016/j.dam.2013.03.009

    • Related Report
      2013 Annual Research Report 2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] グラフ上の石移動と石交換 (デザイン、符号、グラフおよびその周辺)2013

    • Author(s)
      中上川 友樹
    • Journal Title

      京都大学数理解析研究所講究録

      Volume: 1844 Pages: 113-123

    • NAID

      120005554626

    • Related Report
      2013 Annual Research Report
  • [Journal Article] Colored pebble motion on graphs2012

    • Author(s)
      S. Fujita, T. Nakamigawa and T. Sakuma
    • Journal Title

      European J. Combinatorics

      Volume: 33 Pages: 884-892

    • Related Report
      2013 Final Research Report
  • [Journal Article] Counting lattice paths via a new cycle lemma2012

    • Author(s)
      T. Nakamigawa and N. Tokushige
    • Journal Title

      SIAM J. Discrete Math

      Volume: 26 Pages: 745-754

    • Related Report
      2013 Final Research Report
  • [Journal Article] Nodedisjoint paths in a level block of Generalized hierarchical completely-connected networks2012

    • Author(s)
      T. Takabatake and T. Nakamigawa
    • Journal Title

      Theoretical Computer Science

      Volume: 465 Pages: 28-34

    • Related Report
      2013 Final Research Report
  • [Journal Article] Colored Pebble Motion on Graphs2012

    • Author(s)
      S. Fujita, T. Nakamigawa and T. Sakuma
    • Journal Title

      European J. Combinatorics

      Volume: 33 Issue: 5 Pages: 884-892

    • DOI

      10.1016/j.ejc.2011.09.019

    • Related Report
      2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] Counting lattice paths via a new cycle lemma2012

    • Author(s)
      T.Nakamigawa, N.Tokushige
    • Journal Title

      SIAM J. Discrete Math

      Volume: 26 Issue: 2 Pages: 745-754

    • DOI

      10.1137/100796431

    • Related Report
      2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] Nodedisjoint paths in a level block of generalized hierarchical completely-connected networks2012

    • Author(s)
      T. Takabatake and T. Nakamigawa
    • Journal Title

      Theoretical Computer Science

      Volume: 465 Pages: 28-34

    • DOI

      10.1016/j.tcs.2012.09.016

    • Related Report
      2012 Research-status Report
    • Peer Reviewed
  • [Presentation] A Ramsey-type Theorem for Multiple Disjoint Copies of Induced Subgraphs (Extended Abstract)2013

    • Author(s)
      T. Nakamigawa
    • Organizer
      Electronic Notes in Discrete Mathematics (Vol. 43 (Eldõs Centennial))
    • Related Report
      2013 Final Research Report
  • [Presentation] An extremal problem for vertex decomposition of complete multipartite graphs2013

    • Author(s)
      T. Nakamigawa
    • Organizer
      Graph Theory Conference in honor of Yoshimi Egawa on the occasion of his 60th birthday
    • Related Report
      2013 Final Research Report
  • [Presentation] A Ramsey-type Theorem for Multiple Disjoint Copies of Induced Subgraphs (Extended Abstract)2013

    • Author(s)
      Tomoki Nakamigawa
    • Organizer
      Erdos Centennial Conference
    • Place of Presentation
      Budapest, Hungary
    • Related Report
      2013 Annual Research Report
  • [Presentation] An extremal problem for vertex decomposition of complete multipartite graphs2013

    • Author(s)
      Tomoki Nakamigawa
    • Organizer
      Graph Theory Conference in honor of Yoshimi Egawa on the occasion of his 60th birthday
    • Place of Presentation
      Kagurazaka Campus of Tokyo University of Science
    • Related Report
      2013 Annual Research Report
  • [Presentation] 誘導部分グラフの点素なコピーについて2012

    • Author(s)
      中上川 友樹
    • Organizer
      渡辺守先生ご退職記念関西グラフ理論研究集会
    • Place of Presentation
      加計国際学術交流センター
    • Related Report
      2013 Final Research Report
  • [Presentation] グラフ上の石移動と石交換2012

    • Author(s)
      中上川 友樹
    • Organizer
      RIMS 共同研究『デザイン, 符号, グラフおよびその周辺』
    • Place of Presentation
      京都大学数理解析研究所
    • Related Report
      2013 Final Research Report
  • [Presentation] 誘導部分グラフの点素なコピーに関するラムゼー型問題2012

    • Author(s)
      中上川 友樹
    • Organizer
      日本数学会2012年度秋季総合分科会
    • Place of Presentation
      九州大学
    • Related Report
      2013 Final Research Report 2012 Research-status Report
  • [Presentation] Hamiltonian path in generalized hierarchical completely-connected networks2012

    • Author(s)
      T. Takabatake and T. Nakamigawa
    • Organizer
      The 3rd International Conference on Mathematical Models for Engineering Science
    • Place of Presentation
      Paris, France
    • Related Report
      2013 Final Research Report
  • [Presentation] グラフの頂点集合の分割に関する問題2012

    • Author(s)
      中上川 友樹
    • Organizer
      応用数学合同研究集会
    • Place of Presentation
      龍谷大学瀬田キャンパス
    • Related Report
      2013 Final Research Report
  • [Presentation] グラフ上の石移動と石交換2012

    • Author(s)
      中上川 友樹
    • Organizer
      RIMS共同研究『デザイン、符号、グラフおよびその周辺』
    • Place of Presentation
      京都大学数理解析研究所
    • Related Report
      2012 Research-status Report
    • Invited
  • [Presentation] グラフの頂点集合の分割に関する問題2012

    • Author(s)
      中上川 友樹
    • Organizer
      応用数学合同研究集会
    • Place of Presentation
      龍谷大学
    • Related Report
      2012 Research-status Report
  • [Presentation] Evaluation of the node-disjoint paths in a level block of generalized hierarchical completely-connected networks2012

    • Author(s)
      T. Takabatake, T. Nakamigawa
    • Organizer
      Proceedings of the 13th Symposium of Mathematics and its Applications, Politehnica University of Timisoara
    • Place of Presentation
      Politehnica University of Timisoara, Romania
    • Related Report
      2012 Research-status Report
  • [Presentation] Hamiltonian path in generalized hierarchical completely-connected networks2012

    • Author(s)
      T. Takabatake, T. Nakamigawa
    • Organizer
      Proceedings of the 3rd International Conference on Mathematical Models for Engineering Science
    • Place of Presentation
      Paris, France
    • Related Report
      2012 Research-status Report
  • [Presentation] 誘導部分グラフの点素なコピーについて2012

    • Author(s)
      中上川 友樹
    • Organizer
      関西グラフ理論研究集会
    • Place of Presentation
      加計国際学術交流センター(倉敷)
    • Related Report
      2011 Research-status Report
  • [Presentation] グラフの点素かつ同型な誘導部分グラフ2011

    • Author(s)
      中上川 友樹
    • Organizer
      日本数学会秋季総合分科会応用数学分科会
    • Place of Presentation
      信州大学松本キャンパス
    • Related Report
      2013 Final Research Report 2011 Research-status Report
  • [Presentation] グラフ上の石交換2011

    • Author(s)
      中上川 友樹
    • Organizer
      応用数学合同研究集会
    • Place of Presentation
      龍谷大学瀬田キャンパス
    • Related Report
      2013 Final Research Report 2011 Research-status Report
  • [Remarks] 湘南工科大学ホームページの教員情報 (湘南工科大学ホームページ>学部・大学院>工学部>情報工学科>教員情報>中上川友樹准教授)により, 刊行された研究論文が検索できる

    • URL

      http://www.shonan-it.ac.jp/contents/teachers/information/t-nakamigawa/index.html

    • Related Report
      2013 Final Research Report
  • [Remarks] 湘南工科大学ホームページの教員情報

    • URL

      http://www.shonan-it.ac.jp/contents/teachers/information/t-nakamigawa/index.html

    • Related Report
      2012 Research-status Report

URL: 

Published: 2011-08-05   Modified: 2019-07-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi