Báo cáo toán học: "Rainbow H-factors of complete s-uniform r-partite hypergraph" ppt

... partitions of general complete hypergraphs By ˜ K n we denote the complete hyper gr aph on the set of vertices V n , i.e. the hypergraph with the set of edges consisting of all non trivial subsets of ... by  X k  the set of all k-subsets of X. A hypergraph H = (V ; E) is said to be k-uniform if E ⊂  V k  (the cardinality of any edge is equal to k). We shall always assu...

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

... h −1 (t 1 ,t 2 )isclosedinX, i.e., h is a contra-continuous function on X.  The above proof used the technique of proof of Theorem 1 of [5]. If a space has the strong cc-insertion property for (P 1 ,P 2 ), then ... 1975, 27-51. Vietnam Journal of Mathematics 34:1 (2006) 41–49 Strong Insertion of a Contra - Continuous Function * Majid Mirmiran Department of Mathematics, University...

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

... [PY00] Peng and Yan investigate the linear discrepancy of strongly unimodular 0, 1 matrices. One part of their work is devoted to the case of basic strongly unimodular 0, 1 matrices, i. e. strongly ... thereof in X 0 ∪ X 1 . Rows having two non-zeros in M ∪ M 0 were already shown to be good by construction of χ  . All rows being good just means A(p − χ) ∞ ≤ 1 − 1 n+1 . This ends th...

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

... x of F 3 induces a valuation f x : F 1 → N; y → d(x, y) − d(x, F 1 )ofF 1 . So, we can distinguish the points of F 3 by means of the type of valuation of F 1 they induce. From this point of ... valuation of DQ(2n, 2). The complete classification of the valuations of I 4 is however necessary to achieve this goal. Paper [7] will also contain a discussion of the structure...

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

... Betti numbers of ∆ (over K). The link of ∆ with respect to F ∈ ∆ is the simplicial complex lk ∆ (F ) = {G ⊂ [n] \F : G ∪F ∈ ∆}. In the study of face vectors of simplicial complexes, one of important ... characterization of h-vectors of Buchsbaum complexes of a special type including all 2-dimensional connected Buchs- baum complexes, and proved the necessity of the conjecture...

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

... the set of its grid-quads. The automorphism group of G n , n  4, has two orbits on the set of grid-quads of G n , namely the set of grid- quads of Type I and the set of gr id-quads of Type II. Every ... vector of weight 2 of V . If M is a big max of G n , n  3, then  M ∼ = G n−1 . Suppose M is a big max of G n corresponding to a vector ¯x of weight 2 of V . The...

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

... skeleton of a structure A is the set of finite induced substructures of A and the age of A consists of all relational structures isomorphic to an element of the skeleton of the electronic journal of ... main of a function g, then g(B) means the setwise mapping of its elements {g(b) : b ∈ B}. The disti nguishing n umber of A, wr itten D(A), is the smallest cardinality of...

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

... properties of cyclic permu- tations of r. In Section 3, we consider more general cases. 2 Properties of cyclic permutations of a sequence In this section, we study pro perties of cyclic permutations of ... contradiction. the electronic journal of combinatorics 17 (2010), #R117 9 [4] A. Brandt, A generalization of a combinatoria l theorem of Sparre Andersen about sums of r...

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

... is a root of f 1 (x) = 0. This completes the proof. ✷ 3 The proof of The orems 1.5 and 1.6 We will need the following technical lemma whose proof is an easy modification of the proof of Theorem ... holds if R = K r+1−m + M m/2 . This completes the proof. ✷ Proof of Theorem 1.4 . Let H be a graph in H(r, m) with λ 1 (H)  ρ 2 (r, m). With similar proof of Claim 1 in Theorem 1.3, we...

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

... H-factors of complete s-uniform r-partite hypergraphs ∗ Ailian Chen School of Mathematical Sciences Xiamen University, Xiamen, Fujian361005, P. R. China elian1425@sina.com Fuji Zhang School of ... 05C15 Abstract We say a s-uniform r-partite hypergraph is complete, if it has a vertex partition {V 1 , V 2 , . . . , V r } of r classes and its hyperedge set consists of all...

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