Funder
Grantová Agentura Ceské Republiky
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference26 articles.
1. Alon, N.: The number of polytopes, configurations and real matroids. Mathematika 33(1), 62–71 (1986)
2. Alon, N.: Tools from higher algebra. In: Handbook of Combinatorics, vol. 2, pp. 1749–1783. North Holland, Amsterdam (1995)
3. Aprile, M., Faenza, Yu., Fiorini, S., Huynh, T., Macchia, M.: Extension complexity of stable set polytopes of bipartite graphs. In: Graph-Theoretic Concepts in Computer Science (Eindhoven 2017). Lecture Notes in Computer Science, vol. 10520, pp. 75–87. Springer, Cham (2017)
4. Averkov, G., Kaibel, V., Weltge, S.: Maximum semidefinite and linear extension complexity of families of polytopes. Math. Program. Ser. A 167(2), 381–394 (2018)
5. Bárány, I., Pór, A.: On $$0$$-$$1$$ polytopes with many facets. Adv. Math. 161(2), 209–228 (2001)