4 papers
The maximum number of 10- and 12-cycles in a planar graph
Christopher Cox, Ryan R. Martin
For a fixed planar graph , let denote the maximum number of copies of in an -vertex planar graph. In the case when is a…
Restricted online Ramsey numbers of matchings and trees
Joseph Briggs, Christopher Cox
Consider a two-player game between players Builder and Painter. Painter begins the game by picking a coloring of the edges of , which is hidden from Builder. In each round, Bu…
Nearly orthogonal vectors and small antipodal spherical codes
Boris Bukh, Christopher Cox
How can vectors in be arranged so that they are as close to orthogonal as possible? In particular, define $θ(d,k):=\min_X\max_{x\neq y\in X}|\langle x,y\rangle…
On a fractional version of Haemers' bound
Boris Bukh, Christopher Cox
In this note, we present a fractional version of Haemers' bound on the Shannon capacity of a graph, which is originally due to Blasiak. This bound is a common strengthening of both…