BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-72-286
       ENTRY:: October 16, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: On the solution of Moser's problem in four dimensions, and
               related issues. A collection of two papers: On the solution
               of Moser's problem in four dimensions and Independent
               permutations as related to a problem of Moser and a theorem
               of Polya.
        TYPE:: Technical Report
      AUTHOR:: Chandra, Ashok K.
        DATE:: May 1972
       PAGES:: 35
    ABSTRACT:: The problem of finding the largest set of nodes in a d-cube
               of side 3 such that no three nodes are collinear was proposed
               by Moser. Small values of d (viz., $d \leq\ 3$) resulted in
               elegant symmetric solutions. It is shown that this does not
               remain the case in 4 dimensions where at most 43 nodes can be
               chosen, and these must not include the center node.
       NOTES:: [Adminitrivia V1/Prg/19951016]
         END:: STAN//CS-TR-72-286