7 citations · 8 across the 9 of their papers we have counts for
15 papers
Orthogonal realizations of random sign patterns and other applications of the SIPP
Zachary Brennan, Christopher Cox, Bryan A. Curtis +4
A sign pattern is an array with entries in . A matrix is row orthogonal if . The Strong Inner Product Property (SIPP), introduced in [B.A.~Curtis and B.L.~…
Accumulation points of the edit distance function
Christopher Cox, Ryan R. Martin, Daniel McGinnis
Given a hereditary property of graphs and some , the edit distance function is (asymptotically) the maximum proportion o…
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…
Counting paths, cycles and blow-ups in planar graphs
Christopher Cox, Ryan R. Martin
For a planar graph , let denote the maximum number of copies of in an -vertex planar graph. In this paper, we prove that $\o…
Periodic words, common subsequences and frogs
Boris Bukh, Christopher Cox
Let be the -letter word obtained by repeating a fixed word , and let be a random -letter word over the same alphabet. We show several results about the len…
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…
Inverting the Turán Problem
Joseph Briggs, Christopher Cox
Classical questions in extremal graph theory concern the asymptotics of where is a fixed family of graphs and is taken fro…
(4,2)-choosability of planar graphs with forbidden structures
Zhanar Berikkyzy, Christopher Cox, Michael Dairyko +8
All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lis…
Ramsey numbers for partially-ordered sets
Christopher Cox, Derrick Stolee
We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize s…
Chvátal-type results for degree sequence Ramsey numbers
Christopher Cox, Michael Ferrara, Ryan M. Martin +1
A sequence of nonnegative integers is graphic if there is a (simple) graph of order having degree sequence . In this case, is said to realize o…
Counting prime juggling patterns
Esther Banaian, Steve Butler, Christopher Cox +3
Juggling patterns can be described by a closed walk in a (directed) state graph, where each vertex (or state) is a landing pattern for the balls and directed edges connect states t…
A generalization of Eulerian numbers via rook placements
Esther Banaian, Steve Butler, Christopher Cox +3
We consider a generalization of Eulerian numbers which count the number of placements of "rooks" on an board where there are exactly rooks in each row and each…
Ordered Ramsey numbers of loose paths and matchings
Christopher Cox, Derrick Stolee
For a -uniform hypergraph with vertex set , the ordered Ramsey number is the least integer such that every -coloring of the e…