Hello,
a new member submitted a talk for the event BIRZEIT18RAND:

• Name : Dandurand
• First name : Julia
• University : California State University,Northridge
• Email : julia.dandurand.7@my.csun.edu
• Position : Master-student
• Title of the talk : Settling the Blazek-Koman Conjecture for k-page Book Drawings of Complete Graphs with at most 3k Vertices
• 'Long<->Short' talk : short
• Summary : Determining the crossing number of a graph, that is, the minimum number of crossings among all drawings of the graph, is a problem in Discrete Geometry. In the 60s, Blazek and Koman found k-page book drawings of the complete graph with few crossings and conjectured that their drawings had the minimum possible number of crossings. This conjecture was recently settled for k = 2 but remains open for larger values of k. This talk presents our work in proving the conjecture when the ratio of the number of vertices to the number of pages is small.
• Request for accommodation financial support in Ramallah : Yes