(Department of Mathematics, University of Manitoba)

The crossing number of a graph

Date: Friday, December 8, 2017

A graph G is called "planar" if G can be drawn in the plane so that no edges cross. It is known that the graphs K_5 and K_{3,3} are not planar. For a graph H that is not planar, one can measure the "non-planarity" by counting its "crossing number", the minimum number of edge crossings required in any drawing of H in the plane.

This talk surveys some facts about crossing numbers and their variants, some basic inequalities, and applications.

Click for abstract

Important Dates

February 19: Louis Riel Day (University Closed)

February 19 – February 23: Reading Week (No classes)

Upcoming Exam

MATH 1500 Midterm
Thursday, March 1 at 5:40 p.m.

Upcoming Seminars

Combinatorics seminar:
Shonda Gosselin: Metric Dimension of Circulant Graphs and Cayley Hypergraphs
Friday, March 9 at 15:30, 415 Machray Hall.

Combinatorics seminar:
Ben Li: TBA
Friday, March 16 at 15:30, 415 Machray Hall.

Colloquium talk:
Hadrien Montanelli: Pattern formation on the sphere
Friday, March 23 at 14:30, 418 Machray Hall.