Georgia Institute of Technology College of Sciences

We derive optimal strategies for a pursuit-and-evasion game and show that when pitted against each other, the two strategies construct a small set containing unit-length line segments at all angles. Joint work with Y. Babichenko, Y. Peres, R. Peretz, and P. Sousi.

Classical vertex coloring problems ask for the minimum number of colors needed to color the vertices of a graph, such that adjacent vertices use different colors. Vertex coloring does have quite a few practical applications in communication theory, industry engineering and computer science. Such examples can be found in the book of Hansen and Marcotte. Deciding whether a graph is 3-colorable or not is a well-known NP-complete problem, even for triangle-free graphs. Intutively, large girth may help reduce the chromatic number. However, in 1959, Erdos used the probabilitic method to prove that for any two positive integers g and k, there exist graphs of girth at least g and chromatic number at least k. Thus, restricting girth alone does not help bound the chromatic number. However, if we forbid certain tree structure in addition to girth restriction, then it is possible to bound the chromatic number. Randerath determined several such tree structures, and conjectured that if a graph is fork-free and triangle-free, then it is 3-colorable, where a fork is a star K1,4 with two branches subdivided once. The main result of this thesis is that Randerath's conjecture is true for graphs with odd girth at least 7. We also give an outline of a proof that Randerath's conjecture holds for graphs with maximum degree 4.

We prove the moduli space M_{g,n} of the surface of g genus with n punctures admits no complete, visible, nonpositively curved Riemannian metric, which will give a connection between conjectures from P.Eberlein and Brock-Farb. Motivated from this connection, we will prove that the translation length of a parabolic isometry of a proper visible CAT(0) space is zero. As an application of this zero property, we will give a detailed answer toP.Eberlein's conjecture.

Surface bundles and Lefschetz fibrations over surfaces constitute a rich source of examples of smooth, symplectic, and complex manifolds. Their sections and multisections carry interesting information on the smooth structure of the underlying four-manifold. In this talk we will discuss several problems and results on surface bundles, Lefschetz fibrations, and their (multi)sections, which we will tackle, for the most part, using various mapping class groups of surfaces. Conversely, we will use geometric arguments to obtain some structural results for mapping class groups.