Andrii Arman

(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 more information.