Báo cáo toán học: " On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph" ppt

... class="bi x0 y0 w1 h 1" alt =""

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:20

... class="bi x0 y0 w1 h 1" alt =""

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

... class="bi x0 y0 w1 h 1" alt =""

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

... solution. Vietnam Journal of Mathematics 34:2 (2006) 163–170 On the Asymptotic Behavior of Solutions of a Nonlinear Difference Equation with Bounded Multiple Delay Dinh Cong Huong Hanoi Univ. of Science, ... Stable orbits and bifurcation of maps of the interval, Siam J. App. Math. 35 (1978) 260–267. On the Asymptotic Behavior of Solutions of a...

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

... study the continuity of Julia set of some rational maps and the stability of the Hausdorff dimension of the Julia set of polynomials z d + c (d ≥ 2)forsome semi-hyperbolic parameters c in the boundary ... Vietnam Journal of Mathematics 33:3 (2005) 283–289 On the Continuity of Julia Sets and Hausdorff Dimension of Polynomials Zhuang Wei Institu...

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

... is a clique and V (G)=∪ u∈S V u .Hence, χ(G)= α(G). Corollary. If χ(G) ≤ α(G)+ 1 then χ(G) = min{ rank(B) |B ∈B(G)}. For example, consider the Petersen graph G. We have α(G)= ϑ(G)=4, χ(G)= 5.Hence, min{ ... where A(G) is the adjacency matrix of G. Then χ(G)= 3 2and the electronic journal of combinatorics 4 (1997), #R19 3 and α(G) < min{ rank(B) |B ∈B(G)} by theorem....

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

... n)k −1 φ(k). In either case, the inequality in part 1 of the lemma holds. On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs Alan Frieze ∗ Department of Mathematical ... of combinatorics 7 (2000), #R57 4 3 Hamilton Cycles A Hamilton cycle is the union of two perfect matchings and so h(G) ≤ 1 2 m(G) 2 a...

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

... orbits of Singer groups or subgroups of Singer groups. It seems, however, that only point (and, in the case the electronic journal of combinatorics 9 (2002), #R15 8 orbits of any Singer cycle of Σ n−1 on ... In the statement of the following theorem, à denotes the Măobius function, the basic properties of which can be found in, for example, [1]. Theore...

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

... x and y to be row and column sums of a matrix is that they have the same weight. Clearly, the row sums of a member of M are at most n.Conversely,ifx =(x 1 , ,x m ) and 0 x i n,letR = R(x)bethem ... (5) the electronic journal of combinatorics 13 (2006), #N8 5 3 Start of the proof Let N = {0, 1, }. Define the weight of a matrix N to be the sum of its e...

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

... our theorems, proved in the context of partitions, imply new results about pattern-avoiding fillings of Ferrers shapes and pattern-avoiding ordered graphs. Apart from these results, we also present ... with exactly m blocks (see sequence A008277 in [22]). Sagan [21] has described and enumerated the pattern-avoiding classes P (n; π) for the five patterns π of length three. We summarize the...

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

... . 2 The number of matchings in a tree In t his section, we turn to the number of matchings in a graph. This is a lso known as the Hosoya index, or the Z-index in mathematical chemistry. For a rooted ... An interesting paper of Wagner [5] looks at the number of independent sets modulo m. Wagner showed that the pr oportion of trees on n vertices w...

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

... On colorings avoiding a rainb ow cycle and a fixed monochromatic subgraph Maria Axenovich ∗ JiHyeok Choi Department of Mathematics, Iowa State University, Ames, IA 50011 axenovic@iastate.edu, ... induce a star. 1 Introduction and main results Fo r two graphs G and H, an edge coloring of a complete graph is called (H, G)- good if there is no monochromatic copy of G...

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

... weight w in a k- dimensional subspace of F n . Ahlswede, Aydinian, and Khachatrian found a formula for M R [1]. Theorem 1 (Ahlswede, Aydinian, and Khachatrian). Given n, k, w ∈ N, M R (n, k, w) ... M R (n, k, w) . Furthermore, for k, w ∈ N with k  2w and w odd, we have m (k, k, w) = m (k + 1, k, w) = m (k + 2, k, w) =  k w  = M R (k, k, w) = M R (...

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