着色汉明图、最优二进制码和低维0/1-Borsuk问题

{"title":"着色汉明图、最优二进制码和低维0/1-Borsuk问题","authors":"G. Ziegler","doi":"10.1007/3-540-45506-X_12","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":422805,"journal":{"name":"Computational Discrete Mathematics","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"53","resultStr":"{\"title\":\"Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions\",\"authors\":\"G. Ziegler\",\"doi\":\"10.1007/3-540-45506-X_12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":422805,\"journal\":{\"name\":\"Computational Discrete Mathematics\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"53\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/3-540-45506-X_12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-45506-X_12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}