Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference10 articles.
1. J. Ceder, Finite subsets and countable decompositions of Euclidean spaces,Rev. Roumaine Math. Pures Appl. 14 (1969), 1247–1251.
2. R. O. Davies, Covering the plane with denumerably many curves,J. London Math. Soc. 38 (1963), 433–438.
3. R. O. Davies, Partitioning the plane into denumerably many sets without repeated distances,Math. Proc. Cambridge Philos. Soc. 72 (1972), 179–183.
4. P. Erdős and A. Hajnal, On chromatic number of graphs and set-systems,Acta Math. Hungar. 17 (1966), 61–99.
5. P. Erdős, Geometrical and set-theoretical properties of subsets of the Hilbert space,Mat. Lapok 19 (1968), 255–258 (in Hungarian).
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Two Graph Games;The Electronic Journal of Combinatorics;2024-06-14
2. Coloring triangles and rectangles;Commentationes Mathematicae Universitatis Carolinae;2023-11-13
3. Krull dimension in set theory;Annals of Pure and Applied Logic;2023-10
4. Corrigendum to “Countable Decompositions of $$R^2$$ and $$R^3$$”;Discrete & Computational Geometry;2023-08-01
5. Coloring the distance graphs;European Journal of Mathematics;2023-07-28