Circle Graph Obstructions

In this thesis we present a self-contained proof of Bouchet’s characterization of the class of circle graphs. The proof uses signed graphs and is analogous to Gerards’ graphic proof of Tutte’s excluded-minor characterization of the class of graphic matroids

Obstructions to within a few vertices or edges of acyclic

Finite obstruction sets for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem. It has been known for several years that, in principle, obstruction sets can be mechanically computed for most natural lower ideals. In this paper, we describe a general-purpose method for finding obstructions by using a bounded treewidth (or pathwidth) search. We illustrate this approach by characterizing certain families of cycle-cover graphs based on the two well-known problems: $k$-{\sc Feedback Vertex Set} and $k$-{\sc Feedback Edge Set}. Our search is based on a number of algorithmic strategies by which large constants can be mitigated, including a randomized strategy for obtaining proofs of minimality.Comment: 16 page

Minimal Obstructions for Partial Representations of Interval Graphs

Interval graphs are intersection graphs of closed intervals. A generalization of recognition called partial representation extension was introduced recently. The input gives an interval graph with a partial representation specifying some pre-drawn intervals. We ask whether the remaining intervals can be added to create an extending representation. Two linear-time algorithms are known for solving this problem. In this paper, we characterize the minimal obstructions which make partial representations non-extendible. This generalizes Lekkerkerker and Boland's characterization of the minimal forbidden induced subgraphs of interval graphs. Each minimal obstruction consists of a forbidden induced subgraph together with at most four pre-drawn intervals. A Helly-type result follows: A partial representation is extendible if and only if every quadruple of pre-drawn intervals is extendible by itself. Our characterization leads to a linear-time certifying algorithm for partial representation extension

Obstructions to nonpositive curvature for open manifolds

We study algebraic conditions on a group G under which every properly discontinuous, isometric G-action on a Hadamard manifold has a G-invariant Busemann function. For such G we prove the following structure theorem: every open complete nonpositively curved Riemannian K(G,1) manifold that is homotopy equivalent to a finite complex of codimension >2 is an open regular neighborhood of a subcomplex of the same codimension. In this setting we show that each tangential homotopy type contains infinitely many open K(G,1) manifolds that admit no complete nonpositively curved metric even though their universal cover is the Euclidean space. A sample application is that an open contractible manifold W is homeomorphic to a Euclidean space if and only if the product of W and a circle admits a complete Riemannian metric of nonpositive curvature.Comment: 29 page

Connecting orbits for families of Tonelli Hamiltonians

We investigate the existence of Arnold diffusion-type orbits for systems obtained by iterating in any order the time-one maps of a family of Tonelli Hamiltonians. Such systems are known as 'polysystems' or 'iterated function systems'. When specialized to families of twist maps on the cylinder, our results are similar to those obtained by Moeckel [20] and Le Calvez [15]. Our approach is based on weak KAM theory and is close to the one used by Bernard in [3] to study the case of a single Tonelli Hamiltonian.Comment: 44 pages, submitte