نتایج جستجو برای: shellable graph

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

1980
ANDERS BJÖRNER

In this paper we study shellable posets (partially ordered sets), that is, finite posets such that the simplicial complex of chains is shellable. It is shown that all admissible lattices (including all finite semimodular and supersolvable lattices) and all bounded locally semimodular finite posets are shellable. A technique for labeling the edges of the Hasse diagram of certain lattices, due to...

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...

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: :Electronic Journal of Combinatorics 2023

The augmented Bergman complex of a closure operator on finite set interpolates between the order proper flats and independence operator. In 2020, Braden, Huh, Matherne, Proudfoot, Wang showed that complexes matroids are always gallery-connected, recently Bullock, Kelley, Reiner, Ren, Shemy, Shen, Sun, Tao, Zhang strengthened "gallery-connected" to "shellable" by providing two classes shelling o...

Journal: :Journal of Algebraic Combinatorics 2009

1990
Winfried Hochstättler

In Man82] A. Mandel proved that the maximal cells of an Oriented Matroid poset are B-shellable. Our result shows that the whole Oriented Matroid is shellable, too.

Journal: :J. Comb. Theory, Ser. A 1999
Dmitry N. Kozlov

To every directed graph G one can associate a complex (G) consisting of directed subforests. This construction, suggested to us by R. Stanley, is especially important in the case of a complete double directed graph Gn, where it leads to studying some interesting representations of the symmetric group and corresponds (via Stanley-Reisner correspondence) to an interesting quotient ring. Our main ...

Journal: :Discrete & Computational Geometry 1998
Günter M. Ziegler

There is a long history of constructions of non-shellable triangulations of -dimensional (topological) balls. This paper gives a survey of these constructions, including Furch’s 1924 construction using knotted curves, which also appears in Bing’s 1962 survey of combinatorial approaches to the Poincaré conjecture, Newman’s 1926 explicit example, and M. E. Rudin’s 1958 non-shellable triangulation...

20042005200620072008200920102011201220132014201520162017201820192020202120222023050001000015000

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

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