On independence numbers of distance graphs with vertices in {-1,0,1} n : estimates, conjectures, and applications to the Nelson–Erdős–Hadwiger problem and the Borsuk problem

This publication has 29 references indexed in Scilit:

• Estimating the chromatic numbers of Euclidean space by convex minimization methods
  Sbornik: Mathematics, 2009
• О хроматических числах вещественных и рациональных пространств с вещественными или рациональными запрещенными расстояниями
  2008
• Three lectures on the Borsuk partition problem
  2007
• Borsuk's problem and the chromatic numbers of some metric spaces
  Russian Mathematical Surveys, 2001
• The Complete Intersection Theorem for Systems of Finite Sets
  European Journal of Combinatorics, 1997
• О размерности в проблеме Борсука
  1997
• A counterexample to Borsuk’s conjecture
  Bulletin of the American Mathematical Society, 1993
• Illuminating sets of constant width
  Mathematika, 1988
• Forbidden intersections
  Transactions of the American Mathematical Society, 1987
• The realization of distances within sets in Euclidean space
  Mathematika, 1972