Previous month Previous day Next day Next month
See by year See by month Jump to month

Laszlo A. Szekely (University of South Carolina): Biplanar and k-planar crossing numbers

 Download as iCal file
Tuesday, 23. June 2015, 10:00 - 11:00
Abstract. I'll discuss the following relaxation of the concept of the ordinary crossing number: partition the edge set of the graph into k graphs, so that the
sum of the ordinary crossing numbers of the k graphs is minimized. The minimum sum is the k-planar crossing number of the graph, and the k = 2 case is called the biplanar crossing number of the graph. I'll discuss some old and new results on how the k-planar crossing number is related to the ordinary crossing number. The old work is with Czabarka, Shahrokhi, Sykora and Vrt'o, while the new work is with Pach, Geza Toth and Csaba Toth.
Location : Riesz terem, Bolyai Epulet, I. emelet

Back

JEvents v3.1.8 Stable   Copyright © 2006-2013