Combinatorics Seminar

When: Sunday, May 5, 10am

Where: Schreiber 309

Speaker: Ohad Noy Feldheim, Tel Aviv University

Title: Probabilistic Questions on Discrete Spaces: Three Edge Lengths Suffice for Drawing Outerplanar Graphs


After a brief overview of the main results obtained in my PhD thesis, which deals with probabilistic questions on discrete spaces, I will talk about the proof of the following particular example.

For any outerplanar graph G there exists a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi, Dujmovic, Morin and Wood. The proof combines (elementary) geometric, combinatorial, algebraic and probabilistic arguments.

This is the public presentation of (part of) the PhD thesis of the speaker carried out under the supervision of Prof. Noga Alon.

w3c valid   accessible website
redesigned by barak soreq