Simplicial Minors and Decompositions of Graphs
نویسنده
چکیده
منابع مشابه
Simplicial Decompositions, Tree-decompositions and Graph Minors
The concepts of simplicial decompositions, tree-decompositions and simplicial tree-decompositions were all inspired by a common forerunner: the decompositions of finite graphs used by K. Wagner in his classic paper [ 13 ], in which he proved the equivalence of the 4-Colour-Conjecture to Hadwiger’s Conjecture for n = 5. To show that the 4CC implies Hadwiger’s Conjecture (for n = 5), Wagner used ...
متن کاملSimplicial tree-decompositions of infinite graphs, I
This paper is intended as an introduction to the theory of simplicial decompositions of graphs. It presents, in a unified way, new results as well as some basic old ones (with new proofs). Its main result is a structure theorem for infinite graphs with a simplicial tree-decomposition into primes. The existence and uniqueness of such prime decompositions will be investigated in two subsequent pa...
متن کاملVertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کاملSimplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions
In this second of three papers on the same subject we obtain a first characterization of the countable graphs that admit a simplicial tree-decomposition into primes. This paper is a continuation of [ 4 ]. The problem it tackles, the existence of simplicial tree-decompositions into primes, was introduced in [ 4 ], and all the notation used is explained there. To repeat just the most basic defini...
متن کاملGröbner Geometry of Vertex Decompositions and of Flagged Tableaux
We relate a classic algebro-geometric degeneration technique, dating at least to [Hodge 1941], to the notion of vertex decompositions of simplicial complexes. The good case is when the degeneration is reduced, and we call this a geometric vertex decomposition. Our main example in this paper is the family of vexillary matrix Schubert varieties, whose ideals are also known as (one-sided) ladder d...
متن کامل