Báo cáo toán học: "A Bound for Size Ramsey Numbers of Multi-partite Graphs" pot
... Gorgol, On bounds for size Ramsey numbers of a complete tripartite graph, Discrete Math. 164 (1997), 149–153. the electronic journal of combinatorics 14 (2007), #N11 5 • every vertex of V (F ) ... electronic journal of combinatorics 14 (2007), #N11 3 A Bound for Size Ramsey Numbers of Multi-partite Graphs Yuqin Sun and Yusheng Li ∗ Department of Mathematics, To...
Ngày tải lên: 07/08/2014, 13:21
... senses of one word PROCEDURE: STEP 1. Form a similarity list ]or each sense of one of the words. Pick one of the words, say W2, and using WordNet, form a similarity list for each sense of that ... (W~ NEAR W~(k'))) for all 1 < i < m. Using one of these queries, we get the number of hits for each sense i of W2 and this provides a ranking of the m senses...
Ngày tải lên: 08/03/2014, 06:20
... Asymptotic Bounds for Bipartite Ramsey Numbers Yair Caro Department of Mathematics University of Haifa - Oranim Tivon 36006, Israel ya caro@kvgeva.org.il Cecil Rousseau Department of Mathematical ... coloring of the edges of K r,r contains either a red K m,m or a green K n,n . We obtain asymptotic bounds for b (m, n ) for m ≥ 2 fixed and n → ∞. 1 Introduction Recent exact r...
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: "Lower Bound for the Size of Maximal Nontraceable Graphs." pot
... for n ≥ 7. Combined results of Clark, Entringer and Shapiro [3], [4] and Lin, Jiang, Zhang and Yang [7] show that f(n)=3n/2 for n ≥ 19 and for n =6, 10, 11, 12, 13, 17. The values of f(n) for ... to prove that a MNT graph of order n ≥ 10 has at least 3n−2 2 edges. The first one concerns the lower bound for the number of edges of MNH graphs. It is the combination of re...
Ngày tải lên: 07/08/2014, 13:21
Báo cáo toán học: " A Recurrence for Counting Graphical Partitions" ppsx
... the i-th column of the Ferrars graph of π.TheDurfee square of π is the largest square subarray of dots in the Ferrars graph of π.Letd(π)denotethesize(numberofrows)oftheDurfeesquareof π. The sequence (π 1 − ... 21248279009367 0.350319 Table 2: Sizes of G(n)andP (n) and their ratio for 112 ≤ n ≤ 220. the electronic journal of combinatorics 2 (1995), #R11 3 2 The Recurrence For...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "A β INVARIANT FOR GREEDOIDS AND ANTIMATROIDS GARY GORDON" pptx
... number of elements of C F which cover exactly k elements of C F , then g n−k = w + k , the (unsigned) k th Whitney number. Thus, g k is the number of free convex sets of size k.By Proposition 8 of ... of greedoids. For matroids, the Whitney numbers of the first kind are the face enumerators for the broken circuit complex [3]. In [19], we define Whitney numbers of the...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: " A criterion for unimodality" docx
... 1.ThecaseP(x)=x n in Theorem 2.1 gives the unimodality of the bino- mial coefficients. Example 2 .For0 ≤ k ≤ m − 1, define b k (m):=2 −2m+k 2m − 2k m − k m + k m (a +1) k for 0 ≤ k ≤ m − 1. Then b k+1 (m) b k (m) = (m ... electronic journal of combinatorics 6 (1999), #R10 4 provided 0 < 1 ≤ 2 < 1. Therefore the polynomial P (α,β) m (a):= m k=0 b k (m)(a +1) k is unimodal....
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large" ppt
... asymptotic formulas were presented that apply for n large with b fixed, for various ranges of k. For purposes of comparison, we repeat these results below. Theorem 1 The distribution of the height of ... main results for b-tries for large b (cf. Theorem 2). The proof is delayed until Section 3. It is based on an asymptotic evaluation of a certain integral. 2 Summary of Re...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: " a construction for sets of integers with distinct subset sums" potx
... vectors for the sequences discovered by Lunnon. No proof of Theorem 2.2 will be given because the proof of Theorem 2.2 is ex- tremely similar to the proof of Theorem 2.1 given below. 3 Proof of Theorem ... their sequences of ratios to r. So, L is the best upper bound on f(n) that is achieved with either of these constructions. The rest of this section consists of the calcu...
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: "A characterization for sparse ε-regular pairs" pps
... for some appropriate function f with f(ε) → 0 as ε → 0. The properties of this set concern degrees of vertices and common degrees of vertices with sets of size Θ(1/p) where p is the density of ... P (ε) for a graph of density p in n O(1/p) steps as the most time- consuming part is to consider the neighbourhoods of the sets of size Θ(1/p). Furthermore, in case P (ε) is...
Ngày tải lên: 07/08/2014, 15:22