Hypercube orientations with only two in-degrees
暂无分享,去创建一个
We consider the problem of orienting the edges of the n-dimensional hypercube so only two different in-degrees a and b occur. We show that this can be done, for two specified in-degrees, if and only if obvious necessary conditions hold. Namely, we need 0=
[1] Ron Graham,et al. A note on marking lines in [k]n , 2012, Des. Codes Cryptogr..
[2] Mohammad Taghi Hajiaghayi,et al. Hat Guessing Games , 2008, SIAM Rev..
[3] T. Moon. Error Correction Coding: Mathematical Methods and Algorithms , 2005 .