{"citation":{"ieee":"M. Ziegler and C. Sohler, “Computing Cut Numbers,” in <i>Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)</i>, 2000, pp. 73–79.","mla":"Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” <i>Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)</i>, 2000, pp. 73–79.","ama":"Ziegler M, Sohler C. Computing Cut Numbers. In: <i>Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)</i>. ; 2000:73-79.","bibtex":"@inproceedings{Ziegler_Sohler_2000, title={Computing Cut Numbers}, booktitle={Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)}, author={Ziegler, Martin and Sohler, Christian}, year={2000}, pages={73–79} }","chicago":"Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” In <i>Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)</i>, 73–79, 2000.","apa":"Ziegler, M., &#38; Sohler, C. (2000). Computing Cut Numbers. In <i>Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)</i> (pp. 73–79).","short":"M. Ziegler, C. Sohler, in: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79."},"user_id":"15415","date_created":"2020-08-24T10:10:40Z","department":[{"_id":"63"}],"title":"Computing Cut Numbers","_id":"18150","author":[{"first_name":"Martin","full_name":"Ziegler, Martin","last_name":"Ziegler"},{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"}],"abstract":[{"text":"What is the minimum number of hyperplanes that slice all edges of the d-dimensional hypercube? The answers have been known for d<=4.<br>This work settles the problem for d=5 and d=6. More precisely, a computer search implies that 4 hyperplanes do not suffice for this purpose (but 5 do).<br>We also develop computational approaches for attacking this extremal problem from combinatorial geometry in higher dimensions. They allow us to determine for example all maximal sliceable subsets of hypercube edges up to dimension 7.","lang":"eng"}],"status":"public","year":"2000","page":"73-79","publication":"Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG'00)","type":"conference","date_updated":"2022-01-06T06:53:26Z","language":[{"iso":"eng"}]}