Graphs and Matroids Seminar

Title: Stretching drawings of graphs

Abstract: Given a drawing D of a graph (where vertices are dots in the plane and edges are arbitrary curves connecting some pairs of dots), the problem of stretching D consists on finding a drawing similar to D in which edges are straight-line segments.  I will talk about an ongoing attempt to show a statement related to this problem, that if it holds true, it would imply some classic results on drawings of graphs.