Anne Kenyon

collaborators

2 papers

math.CO2017

On the Profile of Multiplicities of Complete Subgraphs

Uriel Feige, Anne Kenyon, Shimon Kogan

Let $G$ be a $2$ -coloring of a complete graph on $n$ vertices, for sufficiently large $n$ . We prove that $G$ contains at least $n^{(\frac{1}{4} - o (1)) l o g n}$ monochromatic comple…

math.CO2015

Tiling with Small Tiles

Anne Kenyon, Martin Tassy

We look at sets of tiles that can tile any region of size greater than 1 on the square grid. This is not the typical tiling question, but relates closely to it and therefore can he…