Drawings of Planar Graphs with Few Slopes and Segments

We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on $n$ vertices has a plane drawing with at most ${5/2}n$ segments and at most $2n$ slopes. We prove that every cubic 3-connected plane graph has a plane drawing with three slopes (and three bends on the outerface). In a companion paper, drawings of non-planar graphs with few slopes are also considered.Comment: This paper is submitted to a journal. A preliminary version appeared as "Really Straight Graph Drawings" in the Graph Drawing 2004 conference. See http://arxiv.org/math/0606446 for a companion pape

On the optimality of the Arf invariant formula for graph polynomials

We prove optimality of the Arf invariant formula for the generating function of even subgraphs, or, equivalently, the Ising partition function, of a graph.Comment: Advances in Mathematics, 201

Fifty Million Elvis Fans Can’t be Wrong

This essay revisits some classic problems in the philosophy of space and time concerning the counting of possibilities. I argue that we should think that two Newtonian worlds can differ only as to when or where things happen and that general relativistic worlds can differ in something like the same way—the first of these theses being quaintly heterodox, the second baldly heretical, according to the mores of contemporary philosophy of physics