Grant: Discovery Grants Program - Individual
St. Francis Xavier University
$12,000.00
Colourings, independence and domination
FY 2008-09
Summary
The main focus of this research proposal is the advancement of combinatorics in the world around us. Combinatorics includes the study of designs, schedules, patterns and configurations. Three areas of interest are:
1) Colouring problems in graphs. Colouring problems involve the assignment of colours, numbers, frequencies, times or other objects to a network, where certain restrictions or properties have to be obeyed. Graph colourings enjoy many practical applications.
2) Connections between domination and colouring problems. Due to the restrictions most commonly placed on a colouring problem, there is a beautiful and intricate connection between colouring and domination in graphs.
3) Discrete time processes, such as modeling the spread of a fire or virus.
This research will be conducted in a way as to help aspiring highly qualified personnel.
Program
Discovery Grants Program - Individual
Recipient
Location
Nova Scotia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
337136-2008
Name nom
Finbow, Stephen
Department département
Mathematics, Statistics and Computing Sciences
Organization id
83
Institution établissement
St. Francis Xavier University
Province en
Nova Scotia
Province fr
Nouvelle-Écosse
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2008
Award amount
12000
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
Colourings, independence and domination
Keyword
NA
Application summary
The main focus of this research proposal is the advancement of combinatorics in the world around us. Combinatorics includes the study of designs, schedules, patterns and configurations. Three areas of interest are:
1) Colouring problems in graphs. Colouring problems involve the assignment of colours, numbers, frequencies, times or other objects to a network, where certain restrictions or properties have to be obeyed. Graph colourings enjoy many practical applications.
2) Connections between domination and colouring problems. Due to the restrictions most commonly placed on a colouring problem, there is a beautiful and intricate connection between colouring and domination in graphs.
3) Discrete time processes, such as modeling the spread of a fire or virus.
This research will be conducted in a way as to help aspiring highly qualified personnel.
