Title: Graphs with Nontrivial Planar Almost Embeddings

Speaker: Radoslav Fulek, NYU

Date and time: 6pm (New York time), Tuesday, February 20, 2024

Place: WWH1314 (room 1314 Warren Weaver Hall, 251 Mercer Street)

...and on Zoom, details on the seminar mailing list

An almost embedding of a graph $G$ is a drawing of $G$ where only adjacent edges may cross. A drawing of a graph is reduced if it contains no empty bigon; equivalently, the number of crossings in the drawing cannot be decreased by homotopies of the edges that do not pass over the vertices. We characterize the class of graphs that have a reduced almost embedding on the sphere with at least one crossing. As an application we improve and generalize a recent result of Garaev about $K_5$ minus an edge answering a question of A. Skopenkov and Karasev.

Joint work with J. Kynčl.