Grant: Canada Research Chairs
University of Waterloo
$100,000.00
Graph Theory
FY 2021-22
Summary
Graph colouring is one of the most important and storied subfields of graph theory. Graph colouring consists of partitioning the nodes in a network into pairwise non-adjacent sets called colours. Dr. Postle¿s research plan is to develop local versions of the most important graph colouring results where local means that the number of colours available at a node only depends on local parameters. This research will therefore generalize in a far-reaching way the previous results in the area while having more promise of future applications. In addition, Dr. Postle will develop distributed efficient algorithms to find such colourings.
Program
Canada Research Chairs
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
CRC-2019-00249
Name nom
Postle, Luke
Department département
Head Office
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2021
Competition year année de concours
2019
Award amount
100000
Program id
CRC
Program name en
Canada Research Chairs
Program name fr
Chaires de recherche du Canada
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
9998
Committee name en
Canada Research Chair Selection Committee
Committee name fr
Comité de sélection des Chaires de recherche du Canada
Area of application code
9999
Area of application group en
Not available
Area of application group fr
Non disponible
Area of application en
Not available
Area of application fr
Non disponible
Research subject code
2900
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Pure mathematics
Research subject fr
Mathématiques pures
Installment
inst:2-1
Partie
1
Nb partie
2
Application title
Graph Theory
Keyword
NSERC
Application summary
Graph colouring is one of the most important and storied subfields of graph theory. Graph colouring consists of partitioning the nodes in a network into pairwise non-adjacent sets called colours. Dr. Postle¿s research plan is to develop local versions of the most important graph colouring results where local means that the number of colours available at a node only depends on local parameters. This research will therefore generalize in a far-reaching way the previous results in the area while having more promise of future applications. In addition, Dr. Postle will develop distributed efficient algorithms to find such colourings.
