Báo cáo toán học: "Independence Complexes of Stable Kneser Graphs" doc

... types of the independence complexes of some stable Kneser graphs are already known. For n = 1, the stable Kneser graphs are complete graphs and thus their independence complexes are wedges of 0-dimensional ... at the homotopy type of the indep en dence complex of SG 2,k is a wedge of spheres of dimension two. Second, we determine the homotopy types of the independe...

Ngày tải lên: 08/08/2014, 14:23

... thought of. We give, without proof, one example which gives smaller graphs than the ones in the proof of Theorem 12. In this example, calculations are carried modulo 2r + 1. We consider a cycle of ... one-identifying code in G with n − 1 vertices. Proof. We refer to [9], which gives an elegant proof of a more general result.  An easy consequence of Lemma 6 is that T 1 = ∅: Corollary...

Ngày tải lên: 07/08/2014, 15:22

... at least 3 vertices of C. Also note that, since G is K − 4 -free, a i cannot be adjacent to 3 consecutive vertices of C. The remainder of the proof of this case consists of considering cases ... completing the proof of Claim 5.  Claim 5 Claim 6 If P = xyz is a path in H with xz /∈ E(G) and {x, z} ⊆ V 4 , then e(P, T i ) ≤ 2 holds for i = 1, 2. Proof of Claim 6: The proof of t...

Ngày tải lên: 08/08/2014, 14:23

... number of vertices is a nontrivial multiple of 12, we construct examples where G 1 consists of just two cycles of equal length but G is not 3-colorable. Finally, we show that if G is a union of two ... “intersection graph” of the components in G 1 and G 2 ). By construction, H is bipartite. The degree of a vertex in H is the number of vertices in the corresponding component o...

Ngày tải lên: 07/08/2014, 21:21

... suspension of a simplicial complex defined in terms of adjacency r elation of the graph (see below for the definition). The above theorem of Jonsson enables us to give another description of Ind(G 2 ) ... and the edge set of G respectively. A graph with non-empty edge set is called a non-null graph. For a vertex v of G, N G (v) denotes the set of all neighbors of v. For a subs...

Ngày tải lên: 08/08/2014, 12:23

Ngày tải lên: 05/08/2014, 09:46

Ngày tải lên: 05/08/2014, 09:46

Ngày tải lên: 05/08/2014, 15:20

Ngày tải lên: 05/08/2014, 15:21

... continuity of θ s in measure implies also Vietnam Journal of Mathematics 34:3 (2006) 353–356 The Embedding of Haagerup L p Spaces Phan Viet Thu Faculty of Math., Mech. and Inform., Hanoi University of ... condition that ψ|N is semifinite, it implies, by a theorem of Takesaki [5], that there is a σ-weakly continuous projection E of norm one of M onto N such that ψ =(ψ| N ) ◦ E....

Ngày tải lên: 06/08/2014, 05:20