Beck, J. van der Waerden and Ramsey type games. Combinatorica 1, 2 (1981), 103-116. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Ramsey Games Against A One-Armed Bandit - Ehud Friedgut Yoshiharu (Correct)
....R(3) 8 and R(k, l) o(R(k, l) while l 3 is fixed, where R(k, l) and R(k, l) are the corresponding o# diagonal numbers. Finally, we mention that other games inspired by Ramsey s theorem have been investigated in several forms. The reader is referred to, for instance, Beck [2, 3, 4, 5], Beck and Csirmaz [1] Erdos and Selfridge [7] and Seress [20] ....
Jozsef Beck, van der Waerden and Ramsey type games, Combinatorica 1 (1981),
Ramsey Theory Applications - Rosta (2004) (Correct)
....[94] studied the achievement game restricted to classical Ramsey theory, where both graphs G and H are complete. They showed that: The first player has winning strategy for the achievement game if G = K n , H = K k and 1 2 log 2 n and it is a tie if k 2(1 o(1) log 2 n. Beck and Csirmaz [30, 31, 32] generalized these to achievement games for uniform hypergraphs. Other studies on winning strategies can be found for example in [102, 140, 163, 161, 199] see also the survey on combinatorial games in general by Guy [139] Slany [232] has created an interactive java version of the graph Ramsey ....
J. Beck, Van der Waerden and Ramsey type games, Combinatorica 1(2) (1981), 103--116.
On-Line Algorithms And Fast Digital Identity Revocation - Lodha (Correct)
....is on line in the strong sense that at the stage of defining the color of x i , we do not know which points will be x i 1 , x i 2 , x s . In fact, we do not know the set S itself. We now outline idea of the proof of Theorem 3. 2 (note that a similar idea was used in earlier papers [9, 10, 11, 12]) Let s suppose that # and k required by condition (3.2) exist. We first define an auxiliary family of big sets of size O(N 1 # ) By applying Theorem 3.4 to this family of big sets , we obtain a partial coloring g : X # red, blue, uncolored in time N # O(1) such that letting S = x ....
J. Beck. Van der Waerden and Ramsey type games. Combinatorica, 1:103--116, 1981.
A Winning Strategy for the Ramsey Graph Game - Pekec (1995) (2 citations) (Correct)
....Maker is guaranteed to have a winning strategy this argument is nonconstructive. The next natural question is can Maker win faster, i.e. can Maker win if N R(n; n) and, ultimately, what is the minimal number of moves needed for Maker to win the game. Using the weight function method, Beck [3] showed that Maker can win if N (2 ffl) n for n sufficiently large. By setting up an appropriate weight function, a weight is assigned to every Kn ae KN and Maker picks an edge (to be colored red) in order to maximize the total weight (i.e. sum of the weights of all Kn s) This winning ....
J. Beck, Van der Waerden and Ramsey type games. Combinatorica 1(1981), 103-116
Efficient Proper 2-coloring of Almost Disjoint Hypergraphs - Beck, Lodha (2002) (1 citation) Self-citation (Beck) (Correct)
....is on line in the strong sense that at the stage of defining the color of x i , we do not know which points will be x i 1 , x i 2 , x s . In fact, we do not even know the set S itself. We now outline idea of the proof of Theorem 1. 3 (note that a similar idea was used in earlier papers [3, 4, 5, 6]) Let s suppose that # and k required by condition (1.5) exist. We first define an auxiliary family of big sets of size O(N 1 # ) By applying Theorem 2.2 to this family of big sets , we obtain a partial coloring g : X # red, blue, uncolored in time N # O(1) such that letting S = x ....
J. Beck, Van der Waerden and Ramsey type games, Combinatorica, 1 (1981), pp. 103--116.
Ramsey Theory Applications - Vera Rosta Dept (Correct)
No context found.
Beck, J. van der Waerden and Ramsey type games. Combinatorica 1, 2 (1981), 103-116.
Combinatorial Games: Selected Bibliography with a Succinct.. - Fraenkel (2006) (2 citations) (Correct)
No context found.
J. Beck [1981], Van der Waerden and Ramsey type games, Combinatorica 1, 103{ 116.
Weak Positional Games on Hypergraphs of Rank Three - Kutz (Correct)
No context found.
Jozsef Beck. Van der Waerden and Ramsey type games. Combinatorica, 2:103--116, 1981.
A Symmetric Strategy in Graph Avoidance Games - Harary, al. (2001) (Correct)
No context found.
J. Beck. Van der Waerden and Ramsey type games. Combinatorica 1:103--116 (1981).
The game of JumbleG - Frieze, Krivelevich, Pikhurko.. (2004) (Correct)
No context found.
J. Beck, Van der Waerden and Ramsey type games, Combinatorica 1 (1981), 103-116.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC