Some Recent Progress and Applications in Graph Minor Theory

In the core of the seminal Graph Minor Theory of Robertson and Seymour lies a powerful theorem capturing the ``rough' structure of graphs excluding a fixed minor. This result was used to prove Wagner's Conjecture that finite graphs are well-quasi-ordered under the graph minor relation. Recently, a number of beautiful results that use this structural result have appeared. Some of these along with some other recent advances on graph minors are surveyed. Research partly supported by Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research, Grant number 16740044, by Sumitomo Foundation, by C & C Foundation and by Inoue Research Award for Young Scientists Supported in part by the Research Grant P1–0297 and by the CRC program On leave from: IMFM & FMF, Department of Mathematics, University of Ljubljana, Ljubljana, Slovenia     

A Structure Theorem for Strong Immersions

A graph H is strongly immersed in G if H is obtained from G by a sequence of vertex splittings (i.e., lifting some pairs of incident edges and removing the vertex) and edge removals. Equivalently, vertices of H are mapped to distinct vertices of G (branch vertices) and edges of H are mapped to pairwise edge‐disjoint paths in G, each of them joining the branch vertices corresponding to the ends of the edge and not containing any other branch vertices. We describe the structure of graphs avoiding a fixed graph as a strong immersion. The theorem roughly states that a graph which excludes a fixed graph as a strong immersion has a tree‐like decomposition into pieces glued together on small edge cuts such that each piece of the decomposition has a path‐like linear decomposition isolating the high degree vertices.     

Achievable sets, brambles, and sparse treewidth obstructions

One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors.     

Extremal results for rooted minor problems

In this article, we consider the following problem. Given four distinct vertices v₁,v₂,v₃,v₄. How many edges guarantee the existence of seven connected disjoint subgraphs X_i for i = 1,…, 7 such that X_j contains v_j for j = 1, 2, 3, 4 and for j = 1, 2, 3, 4, X_j has a neighbor to each X_k with k = 5, 6, 7. This is the so called “rooted K_{3, 4}‐minor problem.” There are only few known results on rooted minor problems, for example, [15,6]. In this article, we prove that a 4‐connected graph with n vertices and at least 5n ? 14 edges has a rooted K_3,4‐minor. In the proof we use a lemma on graphs with 9 vertices, proved by computer search. We also consider the similar problems concerning rooted K_3,3‐minor problem, and rooted K_3,2‐minor problem. More precisely, the first theorem says that if G is 3‐connected and e(G) ≥ 4|G| ? 9 then G has a rooted K_3,3‐minor, and the second theorem says that if G is 2‐connected and e(G) ≥ 13/5|G| ? 17/5 then G has a rooted K_3,2‐minor. In the second case, the extremal function for the number of edges is best possible. These results are then used in the proof of our forthcoming articles 7 , 8 . © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 191–207, 2007     

An intersection theorem in L-convex spaces with applications

A new intersection theorem is obtained in L-convex spaces without linear structure. As its applications, a fixed point theorem, a maximal element theorem, a coincidence theorem, some new minimax inequalities and a saddle point theorem are given in L-convex spaces. Our results generalize many known theorems in the literature.     

Algèbres de Hopf colibres

We prove a structure theorem for the cofree Hopf algebras: such a Hopf algebra is the universal enveloping dipterous algebra of its primitive part. A dipterous algebra is an associative algebra equipped with a structure of left module over itself. This theorem is a consequence of an analogue, in the non-cocommutative framework, of the Poincaré–Birkhoff–Witt theorem and of the Milnor–Moore theorem. To cite this article: J.-L. Loday, M. Ronco, C. R. Acad. Sci. Paris, Ser. I 337 (2003).     

Extending partial isomorphisms on finite structures

We prove the following theorem:Let A be a finite structure in a fixed finite relational language,p ₁,...,p _m partial isomorphisms of A. Then there exists a finite structure B, and automorphismsf _i of B extending thep _i 's. This theorem can be used to prove the small index property for the random structure in this language. A special case of this theorem is, if A and B are hypergraphs. In addition we prove the theorem for the case of triangle free graphs.     

Coincidence theorem for admissible set-valued mappings and its applications in FC-spaces

A new coincidence theorem for admissible set-valued mappings is proved in FC-spaces with a more general convexity structure. As applications, an abstract variational inequality, a KKM type theorem and a fixed point theorem are obtained. Our results generalize and improve the corresponding results in the literature.     

On the structure of a sofic shift space

The structure of a sofic shift space is investigated, and Krieger's embedding theorem and Boyle's factor theorem are generalized to a large class of sofic shifts.

     

The structure theorem of endomorphism algebras for weak Doi-Hopf modules

The paper is concerned with endomorphism algebras for weak Doi-Hopf modules. Under the condition “weak Hopf-Galois extensions”, we present the structure theorem of endomorphism algebras for weak Doi-Hopf modules, which extends Theorem 3.2 given by Schneider in [1]. As applications of the structure theorem, we obtain the Kreimer-Takeuchi theorem (see Theorem 1.7 in [2]) and the Nikshych duality theorem (see Theorem 3.3 in [3]) in the case of weak Hopf algebras, respectively.     

Existence Theorems of Solutions for Generalized Quasi-variational Inequalities, a Minimax Theorem, and a Section Theorem in the Spaces without Linear Structure

In this paper, by using particular techniques, two existence theorems of solutions for generalized quasi-variational inequalities, a minimax theorem, and a section theorem in the spaces without linear structure are established; and finally, a new coincidence theorem in locally convex spaces is obtained.     

Hamilton weights and Petersen minors*

A (1, 2)‐eulerian weight w of a cubic graph is called a Hamilton weight if every faithful circuit cover of the graph with respect to w is a set of two Hamilton circuits. Let G be a 3‐connected cubic graph containing no Petersen minor. It is proved in this paper that G admits a Hamilton weight if and only if G can be obtained from K₄ by a series of Δ?Y‐operations. As a byproduct of the proof of the main theorem, we also prove that if G is a permutation graph and w is a (1,2)‐eulerian weight of G such that (G, w) is a critical contra pair, then the Petersen minor appears “almost everywhere” in the graph G. © 2001 John Wiley & Sons, Inc. J Graph Theory 38: 197–219, 2001     

New Braided Crossed Categories and Drinfel'd Quantum Double for Weak Hopf Group Coalgebras

A simple and nice structure theorem for orthogroups was given by Petrich in 1987. In this paper, we consider a generalized orthogroup, that is, a quasi-completely regular semigroup with a band of idempotents in which its set of regular elements, namely, RegS, forms an ideal of S. A method of construction of such semigroups is provided and as a result, the Petrich structure theorem of orthogroups becomes an immediate corollary of our theorem on generalized orthogroups. An example of such generalized orthogroup is also constructed. This example provides some useful information for the construction of various kinds of quasi-completely regular semigroups.     

An equivariant extension theorem and G-retracts with a finite structure

Let G be a compact Lie group. An equivariant extension theorem for G-spaces with a finite structure is proved. This theorem is then used to give a characterization of G-ANR's and G-AR's for G-spaces with a finite structure.The author gratefully acknowledge the support received from the Forschungsinstitut für Mathematik, ETH Zürich, during the preparation of this paper.     

Interpolation and prediction problems for connected compact abelian groups

Extensions of the Nehari theorem and of the Sarason commutation theorem are given for compact abelian groups whose dual have a complete linear order compatible with the group structure. As a special case a version of the classical interpolation theorem due to Carathéodory — Féjer is obtained.For these groups an extension of the Helson — Szegö theorem and integral representations for positive definite generalized Toeplitz kernels are given.Partially supported by the CDCH of the Universidad Central de Venezuela, and by CONICIT grant G-97000668.     

Gallai–Edmonds structure theorem for weighted matching polynomial

In this paper, we prove the Gallai–Edmonds structure theorem for weighted matching polynomials. Our result implies the Parter–Wiener theorem and its recent generalization about the existence of principal submatrices of a Hermitian matrix whose graph is a tree.     

A Gallai–Edmonds‐type structure theorem for path‐matchings

As a generalization of matchings, Cunningham and Geelen introduced the notion of path‐matchings. We give a structure theorem for path‐matchings which generalizes the fundamental Gallai–Edmonds structure theorem for matchings. Our proof is purely combinatorial. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 93–102, 2004     

Random duality

The purpose of this paper is to provide a random duality theory for the further development of the theory of random conjugate spaces for random normed modules. First, the complicated stratification structure of a module over the algebra L(μ, K) frequently makes our investigations into random duality theory considerably different from the corresponding ones into classical duality theory, thus in this paper we have to first begin in overcoming several substantial obstacles to the study of stratification structure on random locally convex modules. Then, we give the representation theorem of weakly continuous canonical module homomorphisms, the theorem of existence of random Mackey structure, and the random bipolar theorem with respect to a regular random duality pair together with some important random compatible invariants.     

Deformations of symplectic vortices

We prove a gluing theorem for a symplectic vortex on a compact complex curve and a collection of holomorphic sphere bubbles. Using the theorem we show that the moduli space of regular strongly stable symplectic vortices on a fixed curve with varying markings has the structure of a stratified-smooth topological orbifold. In addition, we show that the moduli space has a non-canonical C ¹-orbifold structure.     

Weyl’s theorem and thin spectra

Using the notion of thin sets we prove a theorem of Weyl type for the Wolf essential spectrum ofT ∈β (H). *Further we show that Weyl’s theorem holds for a restriction convexoid operator and consequently modify some results of Berberian. Finally we show that Weyl’s theorem holds for a paranormal operator and that a polynomially compact paranormal operator is a compact perturbation of a diagnoal normal operator. A structure theorem for polynomially compact paranormal operators is also given.