Grants and Contributions:

Back to search

Title:

Extremal and Structural Aspects of Graph Minor Theory

Agreement Number:

RGPIN

Agreement Value:

$100,000.00

Agreement Date:

May 10, 2017 -

Organization:

Natural Sciences and Engineering Research Council of Canada

Location:

Quebec, CA

Reference Number:

GC-2017-Q1-02375

Agreement Type:

Grant

Report Type:

Grants and Contributions

Additional Information:

Grant or Award spanning more than one fiscal year. (2017-2018 to 2022-2023)

Recipient's Legal Name:

Norin, Sergey (McGill University)

Program:

Discovery Grants Program - Individual

Program Purpose:

The goal of this proposal is systematic investigation of extremal and structural properties of minor-closed classes of graphs. Graph minor theory is a deep and rich area of graph theory, initially developed by Robertson and Seymour in a series of twenty three papers. It continues to be an active area of research with extensive algorithmic applications. Some of the methods developed as part of the theory have been successfully used in practical computations.

One of the central results in graph minor theory is the graph structure theorem of Robertson and Seymour, which gives an approximate structural description of graphs that do not contain a fixed graph as a minor. The PI proposes to continue his ongoing long term joint project with Robin Thomas, the goal of which is a refinement of many aspects of this theory. In particular, one of the goals of the project is to obtain tight bounds on connectivity which guarantees existence of certain minors and related configurations (linkages, topological minors, etc.) in large graphs.

The PI also proposes investigation of extremal aspects of graph minor theory. One of the main goal of the proposal in this direction is to show that the density of every minor-closed class of graphs is attained by graphs of bounded pathwidth. The second goal is to compute density of particular minor-closed classes and develop generic tools for this type of problems.

Finally, the PI proposes to investigate relaxations of Hadwiger's conjecture. Hadwiger's conjecture is a longstanding open problem, which greatly strengthens the four-color theorem. It is possibly the most famous open problem in graph theory. The PI has recently announced a proof, joint with Zdenek Dvorak, of one relaxation of the conjecture, improving on earlier results of Kawarabayshi and Mohar, Wood, and Liu and Oum. The PI proposes to extend this result in several directions, in particular, investigating intriguing connections with bootstrap percolation, a concept investigated in probabilistic combinatorics and theoretical physics.