Paul Wollan
I completed my PhD in the Algorithms, Combinatorics, and Optimization program at Georgia Tech. Robin Thomas was my thesis advisor. I spent 2006 as a Postdoctoral Fellow in the Department of Combinatorics and Optimization at the University of Waterloo.
Mathematisches Seminar der
Universität Hamburg
Bundesstr. 55
D-20146 Hamburg
Germany
Phone: +49-40 42838-5142
Email: <last name> at math.uni-hamburg.de
Publications and Recent Manuscripts
An improved linear edge bound for graph linkages (with R. Thomas) European J. of Combinatorics, 26 (2005), 309 - 324.
Generation of simple quadrangulations of the sphere (with G. Brinkmann, S. Greenberg, C. Greenhill, B. McKay, and R. Thomas) Discrete Math., 305 (2005), 33-54.
Non-zero disjoint cycles in highly connected group labeled graphs (with K. Kawarabayashi) J. Combin. Theory Ser. B, 96 (2006), 296 - 301.
Proper minor-closed families are small (with S. Norine, P. Seymour, and R. Thomas) J. Combin. Theory Ser. B, 96 (2006), 754 - 757.
Extremal functions for shortening sets of paths Combinatorics, Probability, and Computing 15 (2006), 927 - 932.
The extremal function for 3-linked graphs (with R. Thomas) J. Combin. Theory Ser. B 98 (2008), 939 - 971.
A weaker version of Lovasz' path removal conjecture (with K. Kawarabayashi, O. Lee, and B. Reed) J. of Combin Theory Ser. B, 98 (2008), 972 - 979.
Extremal functions for rooted minors, J. Graph Theory, 58 (2008), 159-178.
Packing non-zero A-paths in an undirected model of group labeled graphs, to appear: J. Combin. Theory Ser. B.
Voting in agreeable societies (with D. Berg, S. Norine, F.E. Su, and R. Thomas), to appear: AMS Math. Monthly.
Bridges in highly connected graphs, submitted.
K6 minors in 6-connected graphs of bounded treewidth (with K. Kawarabayashi, S. Norine, and R. Thomas) submitted.
Packing cycles with modularity constraints, submitted.
Articles in Preparation
K6 minors in large 6-connected graphs (with K. Kawarabayashi, S. Norine, and R. Thomas).
On the excluded minor structure theorem for graphs of large tree width (with R. Diestel, K. Kawarabayashi, and T. Muller).
The Erdos-Posa property for clique minors in highly connected graphs (with R. Diestel and K. Kawarabayashi).
Finite connectivity in infinite matroids (with H. Bruhn, R. Diestel, and M. Kriesell).
Eliminating an even cycle matroid minor (with B. Guenin and I. Pivotto).
A Whitney-type theorem for even cycle matroids (with B. Guenin and I. Pivotto).