نتایج جستجو برای: shellable graph
تعداد نتایج: 198123 فیلتر نتایج به سال:
Associated to a simple undirected graph G is a simplicial complex ∆G whose faces correspond to the independent sets of G. We call a graph G shellable if ∆G is a shellable simplicial complex in the non-pure sense of Björner-Wachs. We are then interested in determining what families of graphs have the property that G is shellable. We show that all chordal graphs are shellable. Furthermore, we cla...
Let G = (V,E) be a graph. If G is a König graph or if G is a graph without 3-cycles and 5-cycles, we prove that the following conditions are equivalent: ∆G is pure shellable, R/I∆ is Cohen-Macaulay, G is an unmixed vertex decomposable graph and G is well-covered with a perfect matching of König type e1, . . . , eg without 4-cycles with two ei’s. Furthermore, we study vertex decomposable and she...
In the early 60s, Harary and Hill conjectured H(n) := 1 4b2 cbn−1 2 cbn−2 2 cbn−3 2 c to be the minimum number of crossings among all drawings of the complete graph Kn. It has recently been shown that this conjecture holds for so-called shellable drawings of Kn. For n ≥ 11 odd, we construct a non-shellable family of drawings of Kn with exactly H(n) crossings. In particular, every edge in our dr...
We investigate the shellability of polyhedral join $\mathcal{Z}^*_M (K, L)$ simplicial complexes $K, M$ and a subcomplex $L \subset K$. give sufficient conditions necessary on $(K, for being shellable. In particular, we show that some pairs L)$, becomes shellable regardless whether $M$ is or not. Polyhedral joins can be applied to graph theory as independence complex certain generalized version...
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.
The Harary-Hill Conjecture states that the number of crossings in any drawing of the complete graph Kn in the plane is at least Z(n) := 1 4 ⌊ n 2 ⌋ ⌊ n−1 2 ⌋ ⌊ n−2 2 ⌋ ⌊ n−3 2 ⌋ . In this paper, we settle the Harary-Hill conjecture for shellable drawings. We say that a drawing D of Kn is s-shellable if there exist a subset S = {v1, v2, . . . , vs} of the vertices and a region R of D with the fo...
The Harary-Hill conjecture states that for every n > 0 the complete graph on n vertices Kn, the minimum number of crossings over all its possible drawings equals H(n) := 1 4 ⌊n 2 ⌋⌊n− 1 2 ⌋⌊n− 2 2 ⌋⌊n− 3 2 ⌋ . So far, the lower bound of the conjecture could only be verified for arbitrary drawings of Kn with n ≤ 12. In recent years, progress has been made in verifying the conjecture for certain ...
We give new examples of shellable but not extendably shellable two dimensional simplicial complexes. They include minimal examples, which are smaller than those previously known. We also give examples of shellable but not vertex decomposable two dimensional simplicial complexes. Among them are extendably shellable ones. This shows that neither extendable shellability nor vertex decomposability ...
For every directed graph D we consider the complex of all directed subforests Δ(D). The investigation of these complexes was started by D. Kozlov. We generalize a result of Kozlov and prove that complexes of directed trees of complete multipartite graphs are shellable. We determine the h-vector of Δ(Km,n) and the homotopy type of Δ( −→ Kn1,n2,...,nk ).
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید