(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

December 11 – December 21: Fall Term Exam Period (includes tests and midterm exams for Fall/Winter Term classes)

December 22 – January 1: Winter Holiday (University Closed)

Upcoming Exams

MATH 2030 A01 Final Exam
Monday, December 11 at 1:30 p.m.

MATH 1240 Final Exam
Monday, December 11 at 1:30 p.m.

MATH 1700 Final Exam
Tuesday, December 12 at 1:30 p.m.

MATH 1010 Final Exam
Wednesday, December 13 at 6:00 p.m.

Upcoming Seminar

Colloquium talk:
Seth Wolbert
Friday, January 12 at 14:30, 418 Machray Hall.