Báo cáo toán học: "On the chromatic number of simple triangle-free triple systems" pps

... class="bi x0 y1 w1 h 2" alt =""

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

... class="bi x0 y3 w1 h 4" alt =""

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

... class="bi x1 y1 w4 h 2" alt =""

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

... Vietnam Journal of Mathematics 33:3 (2005) 261–270 On the Asymptotic Distribution of the Bootstrap Estimate with Random Resample Size * Nguyen Van Toan Department of Mathematics, College of Science, Hue ... the bootstrap with random resample size which is not independent of the original sample. We find sufficient conditions on the random resample siz...

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

... 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

... On the other hand, many properties of the associated quantum groups to these solutions are obtained in an abstract way. The aim of this work is to study representation category of the matrix quantum ... E ij λ is the matrix of the basis element e ij λ in the representation ρ n ,the matrix C is given in (5). In particular, the left hand-side is zero...

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

... V is either in γ or is adjacent to a vertex in γ.Thedomination number D of G is the size of a dominating set of smallest cardinality. Domination has been the subject of extensive research; see ... zero as n →∞. The treatises of Bollob´as [2] and Janson et al. [8] between them cover the theory of random graphs in admirable detail. Dreyer [3] generalizes some resul...

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

... Z(5,z)+2η ≤ cr D 5,z . Proof:Let h(t k ) be the sum of the number of crossings of the edges of t k with edges not incident on any vertex of T .Lett min be the element of T such that h(t min ) ... e 2 connecting the two endpoints of e 1 and such that there are points of e 2 both inside and outside the closed curve. Definition 2 The crossing number cr G of a...

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

... vertex. 2. The initial vertex of the next edge is v(j, ∓k). 3. Determine the direction of the next edge by the sign of the entry ∓k in list j and the direction of the preceding edge according to the ... combining the information about the direction of the first edge with the corresponding crossing yields a rule for the direction of the second edge. If...

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

... 2z belongs to B ∗ . the electr onic journal of combinatorics 11 (2004), #R52 5 On the chromatic number of intersection graphs of convex sets in the plane ∗ Seog-Jin Kim Department of Mathematics University ... −M(C) 4 Intersection graphs of convex sets with different sizes In this section, we study a more general case. Two convex sets K, D on t...

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

... = n − λ 1 − p,thenc λ α ˆ β = a λ α ˆ β =0.  Example: We use the above theorem to determine the multiplicity of s (13,4,2) in the Kronecker product s (15,4) ∗ s (11,3,2,2,1) . the electronic ... algorithm for the product s (n−p,p) ∗ s λ and give an example of the algorithm. In Section 3 we prove the main theorem which states that the result of the algorithm in...

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

... 05C30 Abstract There are many applications of the enumeration of maps in surfaces to other areas of mathematics and the physical sciences. In particular, in quantum field theory and string theory, there ... i 1  (i − 1) (p, q, n)-dipoles of the second type. In fact, even when considering different rootings of the same dipole, we can obtain different expressions for the...

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

... SDP bound for the nonbinary case was given in [5]. However, the computation of LP and SDP bounds is not tractable for large values of n. In this case the best bound is the well-known Johnson bound ... satisfied by the number of elements of certain codes lying in k-dimensional subspaces of the Hamming Space. The method suffices to give the first proof, that t...

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

... chromatic number, although we phrase it only for chromatic number. In the next section we present the lower bound in Theorem 2 and the rest of the pa- per is devoted to the proof of the upper bound. The ... coloring of a k-graph is a coloring of its vertices such that no edge is monochromatic, and the chromatic number is the minimum number of colors in...

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

... study on the problem of computing the difference between the metric dimension and the determining number of graphs. We provide new proofs and results on the determining number of trees and Cartesian ... 6). P 2 P 3 P 4 P 5 P 3 P 2 Figure 6: Metric basis of P t P m . The connection between the determining number and the metric dimension, an...

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