**Problem of the Week**

**Math Club**

**BUGCAT**

**Zassenhaus Conference**

**Hilton Memorial Lecture**

**BingAWM**

seminars:comb:abstract.200312pis

Graph theory is popular and useful, at least in part, because its objects, graphs, can be very easily visualized: we can always draw them in the plane. From the very beginning, drawing problems played an important role in the development of graph theory. The existence of “nice” drawings of certain graphs led to the development of a special theory for planar graphs that culminated in the solution of the four-color problem.

Many researchers, both in mathematics and other fields, now work in the area of graph drawings. For example, chemists have developed methods for “drawing” large molecular graphs in 3-dimensional space in order to find fast approximate solutions to the Schroedinger equation. Geometers have asked seemingly unrelated questions such as: Which combinatorial polyhedra (= maps on surfaces) can be realized as geometric polyhedra? Or: Which combinatorial configurations can be realized as geometric configurations made of points and straight lines? The purpose of this talk is to present evidence that many such problems can be investigated under a single theory that is based on graph representations. Connections between graph representations and nodal domains will be addressed.

This talk is intended for general audience. It is based on a survey chapter I have written with Arjana Žitnik.

seminars/comb/abstract.200312pis.txt · Last modified: 2020/01/29 14:03 (external edit)

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported