@article{11443,
  abstract     = {Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope P is defined to be the minimum number of facets of a (possibly higher-dimensional) polytope from which P can be obtained as a (linear) projection. This notion is motivated by its relevance to combinatorial optimisation, and has been studied intensively for various specific polytopes associated with important optimisation problems. In this paper we study extension complexity as a parameter of general polytopes, more specifically considering various families of low-dimensional polytopes. First, we prove that for a fixed dimension d, the extension complexity of a random d-dimensional polytope (obtained as the convex hull of random points in a ball or on a sphere) is typically on the order of the square root of its number of vertices. Second, we prove that any cyclic n-vertex polygon (whose vertices lie on a circle) has extension complexity at most 24√n. This bound is tight up to the constant factor 24. Finally, we show that there exists an no(1)-dimensional polytope with at most n vertices and extension complexity n1−o(1). Our theorems are proved with a range of different techniques, which we hope will be of further interest.},
  author       = {Kwan, Matthew Alan and Sauermann, Lisa and Zhao, Yufei},
  issn         = {1088-6850},
  journal      = {Transactions of the American Mathematical Society},
  number       = {6},
  pages        = {4209--4250},
  publisher    = {American Mathematical Society},
  title        = {{Extension complexity of low-dimensional polytopes}},
  doi          = {10.1090/tran/8614},
  volume       = {375},
  year         = {2022},
}

@article{9585,
  abstract     = {An n-vertex graph is called C-Ramsey if it has no clique or independent set of size C log n. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in fact all Ramsey graphs must obey certain “richness” properties characteristic of random graphs. More than 25 years ago, Erdős, Faudree and Sós conjectured that in any C-Ramsey graph there are Ω(n^5/2) induced subgraphs, no pair of which have the same numbers of vertices and edges. Improving on earlier results of Alon, Balogh, Kostochka and Samotij, in this paper we prove this conjecture.},
  author       = {Kwan, Matthew Alan and Sudakov, Benny},
  issn         = {1088-6850},
  journal      = {Transactions of the American Mathematical Society},
  number       = {8},
  pages        = {5571--5594},
  publisher    = {American Mathematical Society},
  title        = {{Proof of a conjecture on induced subgraphs of Ramsey graphs}},
  doi          = {10.1090/tran/7729},
  volume       = {372},
  year         = {2019},
}