looks like this is in an okay place now

1 files changed, 113 insertions, 0 deletions

diff --git a/content/publications.bib b/content/publications.bib
new file mode 100644
index 0000000..d6e8d63
--- /dev/null
+++ b/content/publications.bib
@@ -0,0 +1,113 @@
+@Article{briggscox17,
+  author      = {Joseph Briggs and Christopher Cox},
+  title       = {Inverting the {T}ur{\' a}n problem},
+  abstract    = {Classical questions in extremal graph theory concern the asymptotics of $\operatorname{ex}(G, \mathcal{H})$ where $\mathcal{H}$ is a fixed family of graphs and $G=G_n$ is taken from a "standard" increasing sequence of host graphs $(G_1, G_2, \dots)$, most often $K_n$ or $K_{n,n}$. Inverting the question, we can instead ask how large $|E(G)|$ can be with respect to $\operatorname{ex}(G,\mathcal{H})$. We show that the standard sequences indeed maximize $|E(G)|$ for some choices of $\mathcal{H}$, but not for others. Many interesting questions and previous results arise very naturally in this context, which also, unusually, gives rise to sensible extremal questions concerning multigraphs and non-uniform hypergraphs.},
+
+  keywords    = {pub},
+  journal     = {Discrete Mathematics},
+  year        = {2019},
+  month	      = {Jul.},
+  number      = {7},
+  volume      = {342},
+  pages       = {1865-1884},
+}
+
+@Article{Bukh2018,
+  author      = {Boris Bukh and Christopher Cox},
+  title       = {On a fractional version of {H}aemers' bound},
+  abstract    = {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 Haemers' bound and the fractional chromatic number of a graph. We show that this fractional version outperforms any bound on the Shannon capacity that could be attained through Haemers' bound. We show also that this bound is multiplicative, unlike Haemers' bound.},
+  journal     = {IEEE Transactions on Information Theory},
+  year        = {2018},
+  keywords    = {pub},
+}
+
+@Article{Cox2018,
+  author    = {Christopher Cox and Derrick Stolee},
+  title     = {Ramsey Numbers for Partially-Ordered Sets},
+  journal   = {Order},
+  year      = {2018},
+  month     = {Nov.},
+  keywords  = {pub},
+  volume    = {35},
+  number    = {3},
+  pages     = {557-579},
+}
+
+@Article{BCDHKLMMNPS15choose,
+  author    = {Berikkyzy, Zhanar and Cox, Christopher and Dairyko, Michael and Hogenson, Kirsten and Kumbhat, Mohit and Lidick{\'y}, Bernard and Messerschmidt, Kacy and Moss, Kevin and Nowak, Kathleen and Palmowski, Kevin and Stolee, Derrick},
+  title     = {{$(4,2)$}-choosability of planar graphs with forbidden substructures},
+  journal   = {Graphs and Combinatorics},
+  year      = {2017},
+  volume    = {33},
+  number    = {4},
+  pages     = {751-787},
+  month     = {Jul.},
+  keywords  = {pub},
+  owner     = {Chris},
+  timestamp = {2015.08.05},
+  url       = {http://arxiv.org/abs/1512.03787},
+}
+
+@Article{BBCDLP15euler,
+  author   = {Banaian, Esther and Butler, Steve and Cox, Christopher and Davis, Jeffrey and Landgraf, Jacob and Ponce, Scarlitte},
+  title    = {A generalization of {E}ulerian numbers via rook placements},
+  journal  = {Involve},
+  year     = {2017},
+  volume   = {10},
+  number   = {4},
+  pages    = {691-705},
+  month    = {Mar.},
+  keywords = {pub},
+  owner    = {Chris},
+  url      = {http://arxiv.org/abs/1508.03673},
+}
+
+@Article{BBCDLP15prime,
+  author =   {Banaian, Esther and Butler, Steve and Cox, Christopher and Davis, Jeffrey and Landgraf, Jacob and Ponce, Scarlitte},
+  title =    {Counting prime juggling patterns},
+  journal =  {Graphs and Combinatorics},
+  year =     {2016},
+  volume =   {32},
+  number =   {5},
+  pages =    {1675-1688},
+  month =    {Sep.},
+  keywords = {pub},
+  owner =    {Chris},
+  url =      {http://arxiv.org/abs/1508.05296}
+}
+@Article{CS16orram,
+  Title                    = {Ordered {R}amsey numbers of loose paths and matchings},
+  Author                   = {Cox, Christopher and Stolee, Derrick},
+  Journal                  = {Discrete Mathematics},
+  Year                     = {2016},
+  Month                    = {Feb.},
+  Number                   = {2},
+  Pages                    = {499-505},
+  Volume                   = {339},
+
+  Abstract                 = {For a $k$-uniform hypergraph $G$ with vertex set $\{1,\ldots,n\}$, the ordered Ramsey number $\OR{t}{G}$ is the least integer $N$ such that every $t$-coloring of the edges of the complete $k$-uniform graph on vertex set $\{1,\ldots,N\}$ contains a monochromatic copy of $G$ whose vertices follow the prescribed order. 
+Due to this added order restriction, the ordered Ramsey numbers can be much larger than the usual graph Ramsey numbers. 
+We determine that the ordered Ramsey numbers of loose paths under a monotone order grows as a tower of height two less than the maximum degree in terms of the number of edges.
+We also extend theorems of Conlon, Fox, Lee, and Sudakov [Ordered Ramsey numbers, arXiv:1410.5292] on the ordered Ramsey numbers of 2-uniform matchings to provide upper bounds on the ordered Ramsey number of $k$-uniform matchings under certain orderings.},
+  Keywords                 = {pub},
+  Owner                    = {Chris},
+  Timestamp                = {2015.05.05},
+  Url                      = {http://www.sciencedirect.com/science/article/pii/S0012365X15003477}
+}
+
+@Article{CDDKRT15hanabi,
+  author    = {Cox, Christopher and De Silva, Jessica and DeOrsey, Philip and Kenter, Franklin and Retter, Troy and Tobin, R. Joshua},
+  title     = {How to make the perfect fireworks display: {T}wo strategies for {H}anabi},
+  journal   = {Mathematics Magazine},
+  year      = {2015},
+  volume    = {88},
+  number    = {5},
+  pages     = {323-336},
+  month     = {Dec.},
+  abstract  = {The game of \emph{Hanabi} is a multi-player cooperative card game which has many similarities to a mathematical `hat guessing game.' In \emph{Hanabi}, players do not know the cards in their own hand and must rely on the actions of the other players to communicate information.
+
+This paper presents two strategies for \emph{Hanabi}. Results from computer simulation demonstrate that both strategies perform well. In particular, one strategy achieves a perfect score of 25 points 75 percent of the time.},
+  keywords  = {pub},
+  owner     = {Chris},
+  timestamp = {2015.05.05},
+}