Lower bound theorems for general polytopes

European Journal of Combinatorics - Tập 79 - Trang 27-45 - 2019
Guillermo Pineda-Villavicencio1, Julien Ugon2, David Yost1
1Centre for Informatics and Applied Optimisation, Federation University, Ballarat, Vic. 3353, Australia
2School of Information Technology, Deakin University, Burwood, VIC, 3125, Australia

Tài liệu tham khảo

Bisztriczky, 1996, On a class of generalized simplices, Mathematika, 43, 274, 10.1112/S0025579300011773

Britton, 1973, A complete catalogue of polyhedra with eight or fewer vertices, Acta Crystallogr. Sect. A, 29, 362, 10.1107/S0567739473000963

Brøndsted, 1983, vol. 90

Fusy, 2006, Counting d-polytopes with d+3 vertices, Electron. J. Combin., 13, 10.37236/1049

Grünbaum, 1970, Polytopes, graphs, and complexes, Bull. Amer. Math. Soc., 76, 1131, 10.1090/S0002-9904-1970-12601-5

Grünbaum, 2003, vol. 221

Kallay, 1979

Lee, 1981

McMullen, 1971, The minimum number of facets of a convex polytope, J. Lond. Math. Soc. (2), 3, 350, 10.1112/jlms/s2-3.2.350

McMullen, 1987, Indecomposable convex polytopes, Israel J. Math., 58, 321, 10.1007/BF02771695

McMullen, 1970, vol. 3

Pineda-Villavicencio, 2018, The excess degree of a polytope, SIAM J. Discrete Math., 32, 2011, 10.1137/17M1131994

Prabhu, 1995, Hamiltonian simple polytopes, Discrete Comput. Geom., 14, 301, 10.1007/BF02570708

Shephard, 1963, Decomposable convex polytopes, Mathematika, 10, 89, 10.1112/S0025579300003995

Ziegler, 1995, vol. 152