Báo cáo toán học: "On the Chv´tal-Erd˝s triangle game a o" potx

... otherwise Breaker wins. A particular family of positional games originates from a seminal paper of Chv´atal and Erd˝os [4]. Let P be a monotone graph property. In the biased P -game Maker and Breaker are alternately ... of a fixed graph. Other positional games on graphs that have attracted considerable attention include the diameter game [1], the planarity, colorability, and m...

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

...

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

...

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

... I. Gy˝ori and G. Ladas and P. H. Vlahos, Global attraction in a delay difference equation, Nonlin. Anal. 17 (1991) 473–479. 5. G. Karakostas, Ch. G. Philos, and Y. G. Sficas, The dynamics of some ... solution. Note that, if we choose { λ n } n as above and F (x)=constantorF (x)= a x ,a& gt;0,x∈ (0, +∞) then Theorem 7 is applied, i.e. (2.7), (2.8) always have at least one positive periodi...

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

... permutation is a sequence a 1 a 2 ·· a n such that in any initial factor a 1 a 2 ·· a j ,thenumberofi’s is at least as great as the number of (i + 1)’s for all i.For example 11122321 is a lattice ... s (3,2,1,1) . Remark: The Add[µ]toλ algorithm is the same as the Remmel-Whitney algorithm. We do not label the boxes of λ since, by Remark 1 of [RWy], they will always be...

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

... . 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 ... (1, a −1) ∈ B. Repeating the operation with (−1, 1), we have (1, a) ∈ B for all a. Moreover, (0, 1) ⊙ (1, a) = (0, a) is in B for all a as well. Suppose fo r a fixed...

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

... of flat spaces in a finite geometry and the uniqueness of the hamming and the macdonald codes. Journal of Combinatorial Theory, 1(1):96–104, 1966. [5] W. Cary Huffman and Vera Pless. Fundamentals ... prove Theorem 7. This author and Lucas Sabalka found a more general theorem [6], but they used a different proof technique. Theorem 7 is a generalization of Theorem 6, the MacWilliams...

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

... a few general observations about the F -avoidance game for the case where F is a forest. In Section 3 we turn to the case of paths and present the recursion that allows us to compute the parameter ... introduced above, the player Painter immediately and irrevocably assigns one of r available colors to each vertex as soon as it is revealed, with the goal of avoiding monochr...

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