Báo cáo toán học: "An Anti-Ramsey Condition on Tree" potx

... second ingredient of our proof is the following result of Stiebitz. Lemma 3 ([5]) Let G be a k-critical graph containing at least one vertex of degree k − 1. Then the number of connected components ... electronic journal of combinatorics 1 (1998), #R4 3 Let r be the number of connected components of H(G), then trivially |E(H(G))|≥n H −r. (2) Also, by Lemma 3, the number of connected component...

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

... In this paper we shall prove the Conjecture for n which has only two distinct prime divisors. Theorem 1 The above Conjecture is true for n = p α q β where p, q are distinct ... it. Therefore k  j=1 a (1) j ∈ A 1 + A 2 + ···+ A k , the electronic journal of combinatorics 13 (2006), #N9 2 An addition theorem on the cyclic group Z p α q β Hui-Qin Cao Department of Applied ... nontrivial subgr...

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

... ∞. The second natural question is whether or not we can determine AR(H; b). The first question is answered in [1] by construction, which yields a partial answer to the second. Definition 1. For ... same color, exactly one such edge can be used, implying C v (R) contains a vertex corresponding to one in L(H  ), a contradiction.! Now, let T 0 = T , i = 0, and if T i contains a leaf v i with ......

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

... 14 combinations of configurations and bit rate, conditional probabilities of the form Pr kj [BR k |CFG j ] can be calculated. These probabilities are then organised in conditional probability ... rate given a configuration. In fact, it will be the one which is associated to the highest conditional probability in the respective configuration column. Further information about the resul...

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

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

... 1994 ABSTRACT Twenty-one years after the publication of A Handbook of Integer Sequences, a greatly expanded version of this collection can now be accessed by electronic mail. 1. The on- line version A Handbook ... Robinson, Jeffrey Shallit and Robert Wilson for their contribu- tions, as well as the late Victor Meally, John Riordan and Herman Robinson. Mira Bernstein helped process the most re...

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

... more sophisticated conditions in order to decrease s, the number of trees obtained in the decomposition. This would allow us to soften conditions (4) imposed on D and λ. 4 Constructive lossless ... a construction which is strongly based on lossless expanders and bears similarity with the construction of Wigderson–Zuckerman expanders that beat the eigenvalue bound in [17]. This graph const...

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

... mobile ones. Original article An introduction on below-ground environment and resource acquisition, with special reference on trees. Simulation models should include plant structure and function Loïc ... ions. Ions can move with water by mass flow, or by diffusion. Considering diffusion, it is important to note that large differences exist in ion mobility, depending mainly on their in...

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

... for Semantic Colloca- tion, Proc. of the Third Conference on Applied NLP, pp. 104-110, 1992. [Simmons91] Simmons R. F. and Yu Y H., The Acquisition and Application of Context Sensitive Grammar ... function, it can only satisfy the requirements of Go, So, Th, and Re. Because of the preposition "of", "th~ money" can only be Th. As a result, after con,;ulting the co...

Ngày tải lên: 23/03/2014, 20:20

... Rigau G. 2008. Complete and consistent annotation of wordnet using the top con- cept ontology. In 6th International Conference on Language Resources and Evaluation LREC, Mar- rakesh, Morroco. M. ... Inter- national Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics, pages 105–112, Morris- town, NJ, USA. Association for Comp...

Ngày tải lên: 24/03/2014, 03:20