Avoiding equal distances

@article{Kumar2017AvoidingED,
  title={Avoiding equal distances},
  author={Ashutosh Kumar and Saharon Shelah},
  journal={Fundamenta Mathematicae},
  year={2017},
  volume={236},
  pages={263-267}
}
We show that it is consistent that there is a non meager set of reals each of whose non meager subsets contains equal distances. 

References

SHOWING 1-2 OF 2 REFERENCES
Set Theoretic Constructions in Euclidean Spaces
The most important methods of constructing, via the axiom of choice, various sets and decompositions in Euclidean spaces, omitting some geometrical configurations are surveyed.
On non-denumerable graphs
PROOF. We shall first prove that every complete graph of power t$i can be split up into the countable sum of trees. Let G be a complete graph of cardinal number ML Let {xa}, a n. I t is clear that G