Grant: Discovery Grants Program - Individual
Thompson Rivers University
$14,000.00
Combinatoral problems on matching extension and graph factors
EF 2009-10
Résumé
Graph Theory is an old but re-born and energized branch of mathematics. It has grown rapidly since the 1960's due to its wide range of applications in Physics, Biology and Operations Research, especially since the wide-spread usage of computers and communication networks. The introduction of Graph Theory as a working frame has changed the landscape of scientific investigations completely. Graph Theory has become one of the most active branches of mathematics. Computing science also provides a growing opportunity for the use of Graph Theory. More recently, Graph Theory also became a useful instrument for the study of gene sequences and environment sustainability, management science and logic designing. During the 2006 ICM conference, there were 6 one-hour invited talks related to Combinatorics and Graph Theory, which is clear evidence of the recognition of its importance from the mathematical society.
The proposed program is to expand our knowledge on graph factors, matching extension problem and its variations using multiple approaches from different facets of graph theory disciplines and with different techniques. The goals are to benefit knowledge, both for research and education in three aspects:
1) To understand the structures of proposed problems and to develop decomposition procedure for the purpose of general recursive arguments and possible design of efficient algorithms. This involves generalizing the existing techniques and methods, and creating new analysis tools for the general framework and abstract models;
2) The research will deliver a more consistent and universal framework for the potential applications to other combinatorial problems, applied industrial problems and other mathematical branches;
3) The accumulation of new knowledge and the sub-problems induced from the program will be a valuable asset for the training of HQP and provide a great research opportunity for involvement of undergraduate and graduate students for engaging in creation and exploration of natural sciences.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
122059-2009
Name nom
Yu, Qinglin(Roger)
Department département
Mathematics and Statistics
Organization id
1809
Institution établissement
Thompson Rivers University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2009
Competition year année de concours
2009
Award amount
14000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
337
Committee name en
Pure & Applied Maths - B
Committee name fr
Maths pures et appliquées - B
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2914
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Combinatorics
Research subject fr
Combinatoire
Partie
1
Nb partie
5
Application title
Combinatoral problems on matching extension and graph factors
Keyword
NA
Application summary
Graph Theory is an old but re-born and energized branch of mathematics. It has grown rapidly since the 1960's due to its wide range of applications in Physics, Biology and Operations Research, especially since the wide-spread usage of computers and communication networks. The introduction of Graph Theory as a working frame has changed the landscape of scientific investigations completely. Graph Theory has become one of the most active branches of mathematics. Computing science also provides a growing opportunity for the use of Graph Theory. More recently, Graph Theory also became a useful instrument for the study of gene sequences and environment sustainability, management science and logic designing. During the 2006 ICM conference, there were 6 one-hour invited talks related to Combinatorics and Graph Theory, which is clear evidence of the recognition of its importance from the mathematical society.
The proposed program is to expand our knowledge on graph factors, matching extension problem and its variations using multiple approaches from different facets of graph theory disciplines and with different techniques. The goals are to benefit knowledge, both for research and education in three aspects:
1) To understand the structures of proposed problems and to develop decomposition procedure for the purpose of general recursive arguments and possible design of efficient algorithms. This involves generalizing the existing techniques and methods, and creating new analysis tools for the general framework and abstract models;
2) The research will deliver a more consistent and universal framework for the potential applications to other combinatorial problems, applied industrial problems and other mathematical branches;
3) The accumulation of new knowledge and the sub-problems induced from the program will be a valuable asset for the training of HQP and provide a great research opportunity for involvement of undergraduate and graduate students for engaging in creation and exploration of natural sciences.
