نتایج جستجو برای: pure shellable complex

تعداد نتایج: 870950  

2008
RUSS WOODROOFE

Inspired by several recent papers on the edge ideal of a graph G, we study the equivalent notion of the independence complex of G. Using the tool of vertex decomposability from geometric combinatorics, we show that 5-chordal graphs with no chordless 4-cycles are shellable and sequentially Cohen-Macaulay. We use this result to characterize the obstructions to shellability in flag complexes, exte...

Journal: :European Journal of Combinatorics 2019

Journal: :Discrete & Computational Geometry 2005
Anders Björner Andreas Paffenholz Jonas Sjöstrand Günter M. Ziegler

In 1992 Thomas Bier presented a strikingly simple method to produce a huge number of simplicial (n− 2)-spheres on 2n vertices as deleted joins of a simplicial complex on n vertices with its combinatorial Alexander dual. Here we interpret his construction as giving the poset of all the intervals in a boolean algebra that “cut across an ideal.” Thus we arrive at a substantial generalization of Bi...

2008
LAUREN K. WILLIAMS

In this paper we study the partially ordered set Q of cells in Rietsch’s [20] cell decomposition of the totally nonnegative part of an arbitrary flag variety P ≥0 . Our goal is to understand the geometry of P ≥0 : Lusztig [13] has proved that this space is contractible, but it is unknown whether the closure of each cell is contractible, and whether P ≥0 is homeomorphic to a ball. The order comp...

In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.

Journal: :CoRR 2015
Bernardo M. Ábrego Oswin Aichholzer Silvia Fernández-Merchant Daniel McQuillan Bojan Mohar Petra Mutzel Pedro Ramos R. Bruce Richter Birgit Vogtenhuber

The Harary-Hill conjecture, still open after more than 50 years, asserts that the crossing number of the complete graph Kn is H(n) = 1 4 ⌊ n 2 ⌋⌊ n− 1 2 ⌋⌊ n− 2 2 ⌋⌊ n− 3 2 ⌋ . Ábrego et al. [3] introduced the notion of shellability of a drawing D of Kn. They proved that if D is s-shellable for some s ≥ b 2 c, then D has at least H(n) crossings. This is the first combinatorial condition on a dr...

2000
Masahiro Hachimori

Preface Everything started from one book. I happened to buy the textbook \Lectures on Poly-topes" 98] written by Prof. G unter M. Ziegler, at the university bookstore about ve years ago. I bought it only because the gures (especially of permutahedra and of zonotopal tilings) interested me, but the book turned out to be a very good introduction to the world of poly-topes, starting from fundament...

Journal: :Electr. J. Comb. 2012
Andrew Frohmader

The flag f-vectors of three-colored complexes are characterized. This also characterizes the flag h-vectors of balanced Cohen-Macaulay complexes of dimension two, as well as the flag h-vectors of balanced shellable complexes of dimension two.

Journal: :Eur. J. Comb. 1997
Shmuel Onn

The class of Strongly Signable partially ordered sets is introduced and studied. It is show that strong signability, reminiscent of Björner–Wachs’ recursive coatom orderability, provides a useful and broad sufficient condition for a poset to be dual CR and hence partitionable. The flag h-vectors of strongly signable posets are therefore non-negative. It is proved that recursively shellable pose...

Journal: :Transactions of the American Mathematical Society 1980

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید