Graph Drawing with no k Pairwise Crossing Edges

print

Speaker: 

Saswata Shannigrahi School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha R

Time: 

Wednesday, 26 August 2009 (All day)

Venue: 

  • A-212 (STCS Seminar Room)
We will try to find an upper bound on the number of edges in a graph with no k pairwise crossing edges.