0 KB270 KB42 KB200820252013Debroni, SeanDelisle, ErinDeza, MichelFowler, Patrick W.La Vaissiere, Benoit deMyrvold, WendySethi, AmitWhitney, JosephWoodcock, Jenniferštevilka:2letnik:6str. 197-210COBISSID:16472409ISSN:1855-3966URN:URN:NBN:SI:doc-4M2L1OV3enDruštvo matematikov, fizikov in astronomov SlovenijeArs mathematica contemporaneagraphsindependent setspolyhedrapolytopesteorija grafovMaximum independent sets of the 120-cell and other regular polytopes|A ?$d$?-code in a graph is a set of vertices such that all pairwise distances are at least ?$d$?. As part of a study of ?$d$?-codes of three-and four-dimensional regular polytopes, the maximum independent set order of the 120-cell is calculated. A linear program based on counting arguments leads to an upper bound of 221. An independent set of order 110 in the antipodal collapse of the 120-cell (also known as the hemi-120-cell) gives a lower bound of 220 for the 120-cell itself. The gap is closed by the computation described here, withthe result that the maximum independent set order of the 120-cell is 220. All maximum ?$d$?-code orders of the icosahedron, dodecahedron, 24-cell, 600-cell and 120-cell are reportedTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije