The Namer-Claimer game

  title={The Namer-Claimer game},
  author={Ben Barber},
  journal={Discret. Math.},
  • Ben Barber
  • Published 31 August 2018
  • Computer Science, Mathematics
  • Discret. Math.
In each round of the Namer-Claimer game, Namer names a distance d, then Claimer claims a subset of [n] that does not contain two points that differ by d. Claimer wins once they have claimed sets covering [n]. I show that the length of this game is of order log log n with optimal play from each side. 


The kth upper chromatic number of the line
This paper shows that (k) ( R ) is finite for all k, and defines χ ( k ) ( S ) to be the smallest integer m such that for every k × m array D = ( d ij ) of positive real numbers, S can be colored with the colors C 1, …, C m. Expand
The chromatic number of the plane is at least 5
We present a family of finite unit-distance graphs in the plane that are not 4-colourable, thereby improving the lower bound of the Hadwiger-Nelson problem. The smallest such graph that we have soExpand
Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
Consider a random sum r)\V\ + • • • + r]nvn, where 771, . . . , rin are independently and identically distributed (i.i.d.) random signs and vi, . . . , vn are integers. The Littlewood-Offord problemExpand
The realization of distances within sets in Euclidean space
In 1944 and 1945 H. Hadwiger [1, 2] proved the following theorems. Theorem A. Let E n be covered by n + 1 closed sets. Then there is one of the sets, within which all distances are realized. TheoremExpand
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression.
  • F. Behrend
  • Mathematics, Medicine
  • Proceedings of the National Academy of Sciences of the United States of America
  • 1946
By a modification of Salem and Spencer' method, the better estimate 1-_2/2log2 + e v(N) > N VloggN is shown. Expand
Borsuk's problem and the chromatic numbers of some metric spaces
A detailed survey is given of various results pertaining to two well-known problems of combinatorial geometry: Borsuk's problem on partitions of an arbitrary bounded d-dimensional set of non-zeroExpand
On the upper chromatic numbers of the reals
It is proved that the upper chromatic numbers are finite for higher dimensions under the l1 and l∞ norms, and it is introduced a new related chromatic quantity of a graph G, the chromatic capacity, χcap(G). Expand
Extremal Problems for Affine Cubes of Integers
This paper addresses both density and Ramsey-type questions for affine d-cubes, and improves for upper and lower bounds on h(d,r) are given for d>2. Expand
Short Proofs of Some Extremal Results
These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have been collected together because each case the relevant proofs are quite short. Expand
On the upper chromatic number of a hypergraph
  • V. Voloshin
  • Mathematics, Computer Science
  • Australas. J Comb.
  • 1995
The notion of a of a hypergraph, which is a subset of vertices to be colored so that at least two vertices are of the same color, is introduced and an algorithm for computing the number of colorings of a mixed hypergraph is proposed. Expand