Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Simon Fraser University

$75,000.00

Algebraic and Topological Methods in Graph Theory

EF 2016-17

Résumé
The research program aims to advance knowledge and solve open problems in two broad but interrelated areas: graph theory and theoretical computer science. Our main emphasis is on interplay between combinatorics, algebra, topology and geometry with the main goal to apply the results in the design of efficient algorithms, obtaining lower bounds, and producing tools to handle large networks and large data sets. The following list outlines main research directions.1) Topological and structural graph theory: Study of flexibility of embeddings of graphs in surfaces, crossing numbers, algorithms and obstructions for topological embeddings, graph minors, and immersions of graphs.2) Algebraic graph theory: Study of vertex transitive graphs with aim to increase our understanding of the graph isomorphism problem, eigenvalues of graphs and digraphs.3) Large graphs and graph limits: Limits of sparse graphs and graphs on surfaces or graphs in minor closed families, using approach via geometric methods (circle packing, curvature) and a version of Gromov-Haudorff distance between structured graphs.4) Graph and digraph coloring: Hadwiger's conjecture and its generalizations, the Erdos-Hajnal Conjecture and the Caccetta-Haggkvist Conjecture.
Programme
Discovery Grants Program - Individual
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
311960-2013
Name nom
Mohar, Bojan
Department département
Mathematics
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2016
Competition year année de concours
2013
Award amount
75000
Program id
RGPIN
Program name 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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
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
4
Nb partie
5
Application title
Algebraic and Topological Methods in Graph Theory
Keyword
NSERC
Application summary
The research program aims to advance knowledge and solve open problems in two broad but interrelated areas: graph theory and theoretical computer science. Our main emphasis is on interplay between combinatorics, algebra, topology and geometry with the main goal to apply the results in the design of efficient algorithms, obtaining lower bounds, and producing tools to handle large networks and large data sets. The following list outlines main research directions.1) Topological and structural graph theory: Study of flexibility of embeddings of graphs in surfaces, crossing numbers, algorithms and obstructions for topological embeddings, graph minors, and immersions of graphs.2) Algebraic graph theory: Study of vertex transitive graphs with aim to increase our understanding of the graph isomorphism problem, eigenvalues of graphs and digraphs.3) Large graphs and graph limits: Limits of sparse graphs and graphs on surfaces or graphs in minor closed families, using approach via geometric methods (circle packing, curvature) and a version of Gromov-Haudorff distance between structured graphs.4) Graph and digraph coloring: Hadwiger's conjecture and its generalizations, the Erdos-Hajnal Conjecture and the Caccetta-Haggkvist Conjecture.